Sciweavers

JCT
2006

Sparse halves in triangle-free graphs

13 years 3 months ago
Sparse halves in triangle-free graphs
One of Erdos' favourite conjectures was that any triangle-free graph G on n vertices should contain a set of n/2 vertices that spans at most n2/50 edges. We prove this when the number of edges in G is either at most n2/12 or at least n2/5.
Peter Keevash, Benny Sudakov
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where JCT
Authors Peter Keevash, Benny Sudakov
Comments (0)