On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs

DOI10.1016/j.jctb.2006.03.001zbMath1106.05049OpenAlexW2099989198MaRDI QIDQ859617

József Balogh, Peter Keevash, Benjamin Sudakov

Publication date: 16 January 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.03.001

zbMATH Keywords

extremal graph theoryTurán's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

A note on bipartite subgraphs and triangle-independent sets ⋮ Additive approximation for edge-deletion problems ⋮ On a Conjecture of Erdős, Gallai, and Tuza ⋮ \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups ⋮ On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs ⋮ Triangle packing and covering in dense random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the chromatic number of triangle-free graphs of large minimum degree
• Triangle-Free Graphs with High Minimal Degrees
• Extremal subgraphs of random graphs

This page was built for publication: On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs