On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite

DOI10.1016/j.disc.2007.06.047zbMath1149.05022OpenAlexW2158274269MaRDI QIDQ932657

Tomasz Łuczak, Miklós Simmonovits

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.06.047

zbMATH Keywords

bipartite graphschromatic numberodd cyclesextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearly bipartite graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On a valence problem in extremal graph theory
• On the structure of linear graphs

This page was built for publication: On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite