Timeline for Cliques in Cayley graph on $n$-cycles
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2018 at 3:22 | answer | added | Brendan McKay | timeline score: 3 | |
| Nov 16, 2018 at 21:50 | comment | added | Ilya Bogdanov | On the other hand, if $n$ is even, then any $n$-cycle is odd, hence the graph is bipartite, and there is no triangle in it. | |
| Nov 16, 2018 at 19:34 | comment | added | Ilya Bogdanov | This argument shows also that a subgraph on $\Omega(n)$ vertices cannot have edge density $1-o(1)$. | |
| Nov 16, 2018 at 19:29 | history | edited | Wei Zhan | CC BY-SA 4.0 |
added 258 characters in body
|
| Nov 16, 2018 at 19:29 | comment | added | Ilya Bogdanov | If $n$ is prime, then tge powers of one cycle form a largest size clique. Ondeed, among $n+1$ permutations, two send $1$ to the same element, hence they dp not differ by an $n$-cycle. | |
| Nov 16, 2018 at 17:39 | history | edited | Martin Sleziak |
added the (cayley-graphs) tag
|
|
| Nov 16, 2018 at 17:29 | history | asked | Wei Zhan | CC BY-SA 4.0 |