Timeline for Extremal graph theory - many copies of $K_r$ imply a copy of $r$-chromatic $H$
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14, 2023 at 21:27 | history | edited | Tony Huynh | CC BY-SA 4.0 |
edited body; edited tags
|
| Jun 14, 2023 at 17:52 | vote | accept | Yevgeny Levanzov | ||
| Jun 14, 2023 at 17:44 | answer | added | Tony Huynh | timeline score: 3 | |
| Jun 14, 2023 at 17:21 | comment | added | Louis D | I'm not sure which of these will be helpful to you, but I might start by looking at Theorem 1 in "Graphs with many r-cliques have large complete r-partite subgraphs" by Nikiforov, Lemma 2.1 and Theorem 2.2 in "Hypergraph Turan Problems" by Keevash, and this question together with the answers and comments mathoverflow.net/questions/234278/… | |
| Jun 14, 2023 at 16:17 | history | edited | Yevgeny Levanzov | CC BY-SA 4.0 |
added 26 characters in body
|
| Jun 14, 2023 at 16:16 | comment | added | Yevgeny Levanzov | indeed, not necessarily induced | |
| Jun 14, 2023 at 16:08 | comment | added | Tony Huynh | I guess by copy of $H$ you mean a (not necessarily induced) subgraph? Otherwise, $K_n$ is a counterexample since it does not contain a copy of any $H$ which is not complete. | |
| S Jun 14, 2023 at 15:36 | review | First questions | |||
| Jun 14, 2023 at 15:38 | |||||
| S Jun 14, 2023 at 15:36 | history | asked | Yevgeny Levanzov | CC BY-SA 4.0 |