Making Kr+1-free graphs r-partite

DOI10.1017/S0963548320000590MaRDI QIDQ5886101zbMATH OpenFDO

Authors József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender

Publication date 30 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Erdős-Simonovits stability theoremextremal graphsstabilityTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Exact stability for Turán's theorem
• A stability theorem for maximal \(K_{r+1}\)-free graphs
• Stability results for graphs with a critical edge
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Stability for large forbidden subgraphs

Cites work

• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Exact stability for Turán's theorem
• How to make a graph bipartite
• scientific article; zbMATH DE number 426334 (Why is no real title available?)
• scientific article; zbMATH DE number 4214034 (Why is no real title available?)
• scientific article; zbMATH DE number 3691361 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Making a K₄-free graph bipartite
• Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On the non-(p-1)-partite K_p-free graphs
• Some new results in extremal graph theory
• Stability results for graphs with a critical edge
• Strong Turán stability
• The typical structure of sparse \(K_{r+1}\)-free graphs

Cited in

(11)

• Stability results for graphs with a critical edge
• Stability for large forbidden subgraphs
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Exact stability for Turán's theorem
• Strong Turán stability
• On stability of the Erdős-Rademacher problem
• Making $K_{r+1}$-Free Graphs $r$-partite
• A spectral Erdős-Faudree-Rousseau theorem
• A strong structural stability of \(C_{2 k + 1}\)-free graphs
• Number of copies of \(C_4\) guarantees strong structural stability of graphs forbidding \(C_{2k+1}\)
• Making a K₄-free graph bipartite

This page was built for publication: Making K_r+1-free graphs r-partite

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886101)