Supersaturation problem for color-critical graphs

DOI10.1016/J.JCTB.2016.12.001zbMath1354.05054arXiv1208.4319OpenAlexW1494308504MaRDI QIDQ505915

Zelealem B. Yilma, Oleg Pikhurko

Publication date: 26 January 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.4319

zbMATH Keywords

extremal graph theoryremoval lemmasupersaturationTurán function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Graphs with large maximum degree containing no edge-critical graphs ⋮ Structure and supersaturation for intersecting families ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Supersaturation problem for the bowtie ⋮ Contraction and deletion blockers for perfect graphs and \(H\)-free graphs ⋮ A spectral Erdős-Rademacher theorem ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Stability Results for Two Classes of Hypergraphs ⋮ Supersaturation for subgraph counts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique density theorem
• An approximate version of Sidorenko's conjecture
• On a theorem of Rademacher-Turán
• Counting substructures. I: Color critical graphs
• A correlation inequality for bipartite graphs
• Two approaches to Sidorenko’s conjecture
• The number of cliques in graphs of given order and size
• On the Minimal Density of Triangles in Graphs
• Lower bounds on the number of triangles in a graph
• On the number of complete subgraphs and circuits contained in graphs
• Graph norms and Sidorenko's conjecture

This page was built for publication: Supersaturation problem for color-critical graphs