On a bipartition problem of Bollobás and Scott

Abstract

The bipartite density of a graph G is max {|E(H)|/|E(G)|: H is a bipartite subgraph of G}. It is NP-hard to determine the bipartite density of any triangle-free cubic graph. A biased maximum bipartite subgraph of a graph G is a bipartite subgraph of G with the maximum number of edges such that one of its partite sets is independent in G. Let \( \mathcal{H} \) denote the collection of all connected cubic graphs which have bipartite density \( \tfrac{4} {5} \) and contain biased maximum bipartite subgraphs. Bollobás and Scott asked which cubic graphs belong to \( \mathcal{H} \). This same problem was also proposed by Malle in 1982. We show that any graph in \( \mathcal{H} \) can be reduced, through a sequence of three types of operations, to a member of a well characterized class. As a consequence, we give an algorithm that decides whether a given graph G belongs to \( \mathcal{H} \). Our algorithm runs in polynomial time, provided that G has a constant number of triangles that are not blocks of G and do not share edges with any other triangles in G.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    B. Bollobás and A. D. Scott: On judicious partitions, Period. Math. Hungar.26 (1993), 127–139.

    Article  Google Scholar 

  2. [2]

    B. Bollobás and A. D. Scott: Exact bounds for judicious partitions of graphs, Combinatorica19(4) (1999), 473–486.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    B. Bollobás and A. D. Scott: Problems and results on judicious partitions, Random Structure and Algorithm21 (2002), 414–430.

    MATH  Article  Google Scholar 

  4. [4]

    J. A. Bondy and S. C. Locke: Largest bipartite subgraphs in triangle-free graphs with maximum degree three, J. Graph Theory10 (1986), 477–504.

    MATH  Article  MathSciNet  Google Scholar 

  5. [5]

    C. S. Edwards: Some extremal properties of bipartite graphs, Canad. J. Math.25 (1973), 475–485.

    MATH  MathSciNet  Google Scholar 

  6. [6]

    C. S. Edwards: An improved lower bound for the number of edges in a largest bipartite subgraph, in: Proc. 2nd Czechoslovak Symposium on Graph Theory, Prague (1975), 167–181.

  7. [7]

    G. Hopkins and W. Staton: Extremal bipartite subgraphs of cubic triangle-free graphs, J. Graph Theory6 (1982), 115–121.

    MATH  Article  MathSciNet  Google Scholar 

  8. [8]

    G. Malle: On Maximum bipartite subgraphs, J. Graph Theory6 (1982), 105–113.

    MATH  Article  MathSciNet  Google Scholar 

  9. [9]

    F. Shahrokhi and L. A. Székely: The complexity of the bottleneck graph bipartition problem, J. Combin. Math. Combin. Comp.15 (1994), 221–226.

    MATH  Google Scholar 

  10. [10]

    B. Xu and X. Yu: Triangle-free subcubic graphs with minimum bipartite density, J. Combin. Theory Ser. B98 (2008), 516–537.

    MATH  Article  MathSciNet  Google Scholar 

  11. [11]

    M. Yannakakis: Node- and edge-deletion NP-complete problems, in: STOC’78; Proc. 10th Annual ACM Symposium on Theory of Computing, ACM, New York, (1978), pp. 253–264.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Baogang Xu.

Additional information

Supported by NSFC Project 10671095, and Georgia Institute of Technology.

Partially supported by NSF, NSA, and NSFC Project 10628102.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Xu, B., Yu, X. On a bipartition problem of Bollobás and Scott. Combinatorica 29, 595–618 (2009). https://doi.org/10.1007/s00493-009-2381-x

Download citation

Mathematics Subject Classification (2000)

  • 05C35
  • 05C75
  • 05C85