Timeline for A general Turan-like question
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 15, 2021 at 10:11 | comment | added | David Wood | The first question was answered by Zykov; see users.monash.edu.au/~davidwo/papers/Wood-GC07.pdf | |
| Sep 14, 2021 at 16:17 | comment | added | Will Sawin | The opposite question, about the minimum number of $r$-cliques in a graph without $k$-independent sets (which is basically equivalent for $r=2$) was asked by Erdős in 1962. A reference to some results as well as discussion of prior work is contained in Minimum Number of k-Cliques in Graphs with Bounded Independence Number by Oleg Pikhurko and Emil R. Vaughan in Combinatorics, Probability, and Computing doi.org/10.1007/BF00279952 | |
| Sep 14, 2021 at 12:50 | answer | added | Boris Bukh | timeline score: 2 | |
| Sep 14, 2021 at 12:22 | history | edited | Alex M. | CC BY-SA 4.0 |
MathJaxed
|
| S Sep 14, 2021 at 12:16 | review | First questions | |||
| Sep 14, 2021 at 12:39 | |||||
| S Sep 14, 2021 at 12:16 | history | asked | Danil Akhtiamov | CC BY-SA 4.0 |