Many cliques in \(H\)-free subgraphs of random graphs

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

zbMATH Keywords

random graphschromatic numberTurán type problems

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

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

This page was built for publication: Many cliques in \(H\)-free subgraphs of random graphs