On a bipartition problem of Bollobás and Scott

DOI10.1007/s00493-009-2381-xzbMath1224.05255OpenAlexW1981723335MaRDI QIDQ624186

Xingxing Yu, Bao-Gang Xu

Publication date: 8 February 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-009-2381-x

zbMATH Keywords

bipartite graphbiased maximum bipartite subgraphbipartite density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Graph partitioning: an updated survey

Cites Work

• Unnamed Item
• Unnamed Item
• Exact bounds for judicious partitions of graphs
• Triangle-free subcubic graphs with minimum bipartite density
• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Extremal bipartite subgraphs of cubic triangle-free graphs
• On maximum bipartite subgraphs
• Problems and results on judicious partitions
• Node-and edge-deletion NP-complete problems
• Some Extremal Properties of Bipartite Subgraphs

This page was built for publication: On a bipartition problem of Bollobás and Scott