Many cliques in \(H\)-free subgraphs of random graphs
From MaRDI portal
Publication:1630692
DOI10.4310/JOC.2018.v9.n4.a1zbMath1401.05266arXiv1612.09143MaRDI QIDQ1630692
Clara Shikhelman, Noga Alon, Alexandr V. Kostochka
Publication date: 10 December 2018
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.09143
Related Items
Subgraph densities in a surface, Tree densities in sparse graph classes, Generalized rainbow Turán problems, Random polynomial graphs for random Turán problems, Some sharp results on the generalized Turán numbers, Generalized Turán number of even linear forests, Generalized Turán densities in the hypercube