Triangle-free subcubic graphs with minimum bipartite density (Q2483477)

A graph is subcubic if no degree exceeds 3. The bipartite density of a graph \(G\) is the maximum proportion of all edges of \(G\) contained in a bipartite subgraph of \(G\). Theorem 1.2 contains a proof of the conjecture of [\textit{J. A. Bondy} and \textit{S. C. Locke}, ``Largest bipartite subgraphs in triangle-free graphs with maximum degree three'', J. Graph Theory 10, 477--504 (1986; Zbl 0609.05046)] that there are precisely 7 triangle-free subcubic graphs having bipartite density exactly equal to \(\frac45\). The authors announce that this result will be applied in a forthcoming paper which will solve a problem posed in [\textit{B. Bollobás} and \textit{A. D. Scott}, ``Problems and results on judicious partitions'', Random Struct.\ Algorithms 21, No. 3--4, 414--430 (2002; Zbl 1013.05059)].