József Balogh, Peter Keevash, Benny Sudakov. On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. Journal of Combinatorial Theory, Series A, 96(6):919-932, 2006. [doi]
@article{BaloghKS06,
title = {On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs},
author = {József Balogh and Peter Keevash and Benny Sudakov},
year = {2006},
doi = {10.1016/j.jctb.2006.03.001},
url = {http://dx.doi.org/10.1016/j.jctb.2006.03.001},
researchr = {https://researchr.org/publication/BaloghKS06},
cites = {0},
citedby = {0},
journal = {Journal of Combinatorial Theory, Series A},
volume = {96},
number = {6},
pages = {919-932},
}