Sparse halves in triangle-free graphs

DOI10.1016/J.JCTB.2005.11.003MaRDI QIDQ2496210zbMATH OpenOpenAlexFDO

Authors Peter Keevash, Benny 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

zbMATH Keywords

extremal graph theorylocal density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• More about sparse halves in triangle-free graphs
• Sparse halves in dense triangle-free graphs
• Sparse halves in K4‐free graphs
• Packing triangles in \(K_4\)-free graphs
• The Spectrum of Triangle-Free Graphs

Cites work

• A local density condition for triangles
• How to make a graph bipartite
• scientific article; zbMATH DE number 426334 (Why is no real title available?)
• scientific article; zbMATH DE number 3523543 (Why is no real title available?)
• Local Density in Graphs with Forbidden Subgraphs
• Making a K₄-free graph bipartite
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On the edge distribution in triangle-free graphs
• Some old and new problems in various branches of combinatorics

Cited in

(7)

• More about sparse halves in triangle-free graphs
• Sparse halves in dense triangle-free graphs
• Sparse halves in K4‐free graphs
• K4$K_4$‐free graphs have sparse halves
• The Spectrum of Triangle-Free Graphs
• 10 problems for partitions of triangle-free graphs
• Making a K₄-free graph bipartite

This page was built for publication: Sparse halves in triangle-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496210)