A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity

DOI10.1016/j.jctb.2015.05.001zbMath1319.05074arXiv1501.03129OpenAlexW1543148594MaRDI QIDQ490983

Zoltan Fueredi

Publication date: 21 August 2015

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

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

zbMATH Keywords

stabilityextremal graphsTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (29)

Making K_r+1-free graphs r-partite ⋮ Spectral extremal graphs for intersecting cliques ⋮ Remarks on an edge-coloring problem ⋮ A note on bipartite subgraphs and triangle-independent sets ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ On a colored Turán problem of Diwan and Mubayi ⋮ On graphs with a large number of edge-colorings avoiding a rainbow triangle ⋮ Stability results for graphs with a critical edge ⋮ Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph ⋮ Refinement on Spectral Turán’s Theorem ⋮ Stability of extremal hypergraphs with applications to an edge-coloring problem ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ A Rainbow Erdös--Rothschild Problem ⋮ On stability of the Erdős-Rademacher problem ⋮ Every graph is eventually Turán-good ⋮ Exact solutions to the Erdős-Rothschild problem ⋮ Edge-colorings avoiding patterns in a triangle ⋮ Graphs with many edge-colorings such that complete graphs are rainbow ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ Strong forms of stability from flag algebra calculations ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Two Conjectures in Ramsey--Turán Theory ⋮ The spectral radius of graphs with no odd wheels ⋮ Some sharp results on the generalized Turán numbers ⋮ An extension of the rainbow Erdős-Rothschild problem ⋮ New short proofs to some stability theorems ⋮ Short proofs of some extremal results III ⋮ Stability Results for Two Classes of Hypergraphs ⋮ Exact stability for Turán’s Theorem

Cites Work

• On the computation of edit distance functions
• A new proof of the graph removal lemma
• The maximum edit distance from hereditary graph properties
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On the number of edge disjoint cliques in graphs of given size
• Bipartite subgraphs
• A hypergraph extension of Turán's theorem
• Graph removal lemmas
• Books Versus triangles
• Avoiding Patterns in Matrices Via a Small Number of Changes
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity