On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
From MaRDI portal
(Redirected from Publication:859617)
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
- scientific article; zbMATH DE number 850231
Cites work
- scientific article; zbMATH DE number 3869331 (Why is no real title available?)
- Extremal subgraphs of random graphs
- On the chromatic number of triangle-free graphs of large minimum degree
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Triangle-Free Graphs with High Minimal Degrees
Cited in
(10)- A note on bipartite subgraphs of triangle‐free graphs
- On a Conjecture of Erdős, Gallai, and Tuza
- Triangle packing and covering in dense random graphs
- On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite
- Bipartite induced density in triangle-free graphs
- A note on bipartite subgraphs and triangle-independent sets
- Density conditions for triangles in multipartite graphs
- Additive approximation for edge-deletion problems
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)
