Timeline for "Common-neighbor-regular" graphs
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 25, 2016 at 8:48 | vote | accept | Dominic van der Zypen | ||
| Mar 25, 2016 at 6:37 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 287 characters in body
|
| Mar 25, 2016 at 6:08 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 74 characters in body
|
| Mar 25, 2016 at 6:05 | comment | added | Fedor Petrov | Ah, of course, thank you, in 'straightforward' part we use that $k>1$. But $k=1$ is another well known problem. | |
| Mar 24, 2016 at 22:36 | comment | added | Aaron Meyerowitz | This is a nice analysis but there is a problem with it, at least for $k=1.$ Then you can have $2t$ vertices of degree $2=k+1$ all joined to a vertex of degree $2t.$ | |
| Mar 24, 2016 at 22:05 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 1576 characters in body
|
| Mar 24, 2016 at 13:06 | comment | added | Dominic van der Zypen | Thanks @Fedor for your thoughts! I will think about it... I hope it's OK if I don't accept it yet as it is not yet a full answer, but it provides valuable insights (so I voted it up). Happy Easter | |
| Mar 24, 2016 at 12:14 | history | answered | Fedor Petrov | CC BY-SA 3.0 |