On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
DOI10.1016/J.JCTB.2006.03.001zbMATH Open1106.05049OpenAlexW2099989198MaRDI QIDQ859617FDOQ859617
Benny Sudakov, József Balogh, Peter Keevash
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
extremal graph theory[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn%27s+theorem&go=Go Tur��n's theorem]
Cites Work
Cited In (7)
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- On a Conjecture of Erdős, Gallai, and Tuza
- A note on bipartite subgraphs and triangle-independent sets
- Triangle packing and covering in dense random graphs
- Additive approximation for edge-deletion problems
- On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs
- A note on bipartite subgraphs of triangle‐free graphs
Recommendations
- On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs 👍 👎
- Density conditions for triangles in multipartite graphs 👍 👎
- Dense induced bipartite subgraphs in triangle-free graphs 👍 👎
- Triangle-free subgraphs of random graphs 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859617)
