Sciweavers

JCT
2006
93views more  JCT 2006»
13 years 4 months ago
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
Erdos posed the problem of finding conditions on a graph G that imply t(G) = b(G), where t(G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest nu...
József Balogh, Peter Keevash, Benny Sudakov