On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite
From MaRDI portal
Publication:932657
DOI10.1016/j.disc.2007.06.047zbMath1149.05022MaRDI 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
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
Cites Work