Sciweavers

90
Voted
JCT
2006
70views more  JCT 2006»
15 years 10 days 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 t...
Peter Keevash, Benny Sudakov