On the bipartite density of regular graphs with large girth
Author:
- 1 December 1990
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 14 (6) , 631-634
Abstract
Let B(G) be the edge set of a bipartite subgraph of a graph G with the maximum number of edges. Let bk = inf{|B(G)|/|E(G)‖G is a cubic graph with girth at least k}. We will prove that limk → ∞ bk ≥ 6/7.Keywords
This publication has 3 references indexed in Scilit:
- Largest bipartite subgraphs in triangle‐free graphs with maximum degree threeJournal of Graph Theory, 1986
- Extremal bipartite subgraphs of cubic triangle‐free graphsJournal of Graph Theory, 1982
- Maximum k‐colorable subgraphsJournal of Graph Theory, 1982