Exact stability for Turán’s Theorem

DOI10.19086/aic.31079zbMath1482.05160arXiv2004.10685OpenAlexW4205315408MaRDI QIDQ5028504

Alexander Roberts, Dániel Korándi, Alexander D. Scott

Publication date: 10 February 2022

Published in: Advances in Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

stabilityextremal graph theorystability theoremTurán's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items

Making K_r+1-free graphs r-partite, A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs, On stability of the Erdős-Rademacher problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• How to make a graph bipartite
• Making a \(K_4\)-free graph bipartite
• Unit distances and diameters in Euclidean spaces
• Degrees and matchings
• Stability results for graphs with a critical edge
• The number of graphs without forbidden subgraphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.
• The typical structure of sparse $K_{r+1}$-free graphs
• On the non-(p-1)-partite K_{p}-free graphs
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Stability results for random discrete structures
• Making K_r+1-free graphs r-partite
• Strong Turán stability