Sparse halves in triangle-free graphs
From MaRDI portal
Publication:2496210
DOI10.1016/j.jctb.2005.11.003zbMath1092.05034OpenAlexW2118502851MaRDI QIDQ2496210
Peter Keevash, Benjamin Sudakov
Publication date: 12 July 2006
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.2005.11.003
Related Items (7)
On the local density problem for graphs of given odd-girth ⋮ Sparse halves in K4‐free graphs ⋮ K4$K_4$‐free graphs have sparse halves ⋮ The Spectrum of Triangle-Free Graphs ⋮ Sparse halves in dense triangle-free graphs ⋮ Making a \(K_4\)-free graph bipartite ⋮ More about sparse halves in triangle-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- How to make a graph bipartite
- Making a \(K_4\)-free graph bipartite
- A local density condition for triangles
- Some old and new problems in various branches of combinatorics
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- On the edge distribution in triangle-free graphs
- Local Density in Graphs with Forbidden Subgraphs
This page was built for publication: Sparse halves in triangle-free graphs
