Timeline for Maximal induced cycles on $n$-clique graphs
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 1, 2015 at 9:00 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 120 characters in body
|
| Nov 30, 2015 at 19:55 | vote | accept | Dominic van der Zypen | ||
| Nov 30, 2015 at 15:14 | comment | added | Fedor Petrov | Dima, I mean cliques whose edges in the cycle are not adjacent. | |
| Nov 30, 2015 at 15:11 | comment | added | Dima Pasechnik | Doesn't condition 3 rule out "non-adjacent cliques"? | |
| Nov 30, 2015 at 15:05 | comment | added | Fedor Petrov | No, $c(n)=n$ for all $n>2$. | |
| Nov 30, 2015 at 14:46 | comment | added | Dominic van der Zypen | Not sure if I understand your answer correctly... So you say $c(n) = 3$ for all $n$? And could you indicate which condition is unclear so that I can write it more clearly, please? Thanks! | |
| Nov 30, 2015 at 14:35 | history | answered | Fedor Petrov | CC BY-SA 3.0 |