scientific article; zbMATH DE number 426334

MaRDI QIDQ3137183zbMATH OpenFDO

Authors Ervin Győri, Miklós Simonovits, P. Erdős

Publication date 7 November 1993

zbMATH Keywords

stability theorem

Mathematics Subject Classification ID

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

Recommendations

• How to make a graph bipartite
• Making a K₄-free graph bipartite
• A note on triangle-free and bipartite graphs
• The local density of triangle-free graphs
• On the structure of clique-free graphs

Cited in

(14)

• Dense induced bipartite subgraphs in triangle-free graphs
• New short proofs to some stability theorems
• Sparse halves in triangle-free graphs
• The clique number and the smallest \(Q\)-eigenvalue of graphs
• More about sparse halves in triangle-free graphs
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• Lower bounds for max-cut in H-free graphs via semidefinite programming
• Exact stability for Turán's theorem
• Making K_r+1-free graphs r-partite
• Making an H H‐free graph k k‐colorable
• The Spectrum of Triangle-Free Graphs
• On multicolor Turán numbers
• 10 problems for partitions of triangle-free graphs
• How to make a graph bipartite

This page was built for publication:

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