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 number of edges in a bipartite subgraph. Let c be the least number so that any graph G on n vertices with minimum degree cn has t(G) =

• Type: Journal
• Year: 2006
• Where: JCT
• Authors: József Balogh, Peter Keevash, Benny Sudakov
• Keywords: Conditions, JCT 2006, Largest Number, Triangle-free Subgraph