Extension of Turán's theorem to the 2-stability number

DOI10.1007/S003730200034MaRDI QIDQ1865136zbMATH OpenOpenAlexFDO

Authors Michael U. Gerber, Pierre Hansen, Alain Hertz

Publication date 25 March 2003

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003730200034

zbMATH Keywords

cliqueslower boundsstability numberTurán's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• A new Turán-type theorem for cliques in graphs
• Turán's theorem and k‐connected graphs
• Exact stability for Turán's theorem
• Stability results for graphs with a critical edge
• A hypergraph extension of Turán's theorem

Cited in

(2)

• An extension of Turán's theorem, uniqueness and stability
• Turán's theorem and k‐connected graphs

This page was built for publication: Extension of Turán's theorem to the 2-stability number

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