Extremal bipartite subgraphs of cubic triangle‐free graphs

Abstract
A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.

This publication has 0 references indexed in Scilit: