The authors present a lower bound on the maximum size of a bipartite subgraph of a triangle-free graph that improves a result due to Erdös and Lovász. It also gives a polynomial-time algorithm, while the previous bound was proved by probabilistic methods.
No takes yet. Share an insight, caveat, or question.
Poljak et al. (1994) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: