Maximum edge‐cuts in cubic graphs with large girth and in random cubic graphs

We show that for every cubic graph Gwith sufficiently large girth there exists a probability distribution on edge-cuts in Gsuch that each edge is in a randomly chosen cut with probability at least 0.88672. This implies that Gcontains an edge-cut of size at least 1.33008n, where nis the number of vertices of G, and has fractional cut covering number at most 1.127752. The lower bound on the size of maximum edge-cut also applies to random cubic graphs. Specifically, a random n-vertex cubic graph a.a.s. contains an edge-cut of size 1.33008n- o(n). © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012 © 2012 Wiley Periodicals, Inc.

[1]  Maria J. Serna,et al.  Computation of the Bisection Width for Random d-Regular Graphs , 2004, LATIN.

[2]  Carlos Hoppen,et al.  Properties of graphs with large girth , 2008 .

[3]  Nicholas C. Wormald,et al.  Large independent sets in regular graphs of large girth , 2007, J. Comb. Theory, Ser. B.

[4]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[5]  Nicholas C. Wormald,et al.  The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.

[6]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[7]  Lenka Zdeborová,et al.  A conjecture on the maximum cut and bisection width in random regular graphs , 2009, ArXiv.

[8]  Robert Šámal.  Cubical coloring -- fractional covering by cuts , 2009 .

[9]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[10]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[11]  Vincent Lefèvre,et al.  MPFR: A multiple-precision binary floating-point library with correct rounding , 2007, TOMS.

[12]  Jan Vondrák,et al.  Optimization via enumeration: a new algorithm for the Max Cut Problem , 2001, Math. Program..

[13]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[14]  Maria J. Serna,et al.  Bounds on the bisection width for random d -regular graphs , 2007, Theor. Comput. Sci..

[15]  Robert Sámal.  Fractional covering by cuts , 2005, Electron. Notes Discret. Math..

[16]  William Duckworth,et al.  On the Independent Domination Number of Random Regular Graphs , 2006, Combinatorics, Probability and Computing.

[17]  Ondrej Zýka.  On the bipartite density of regular graphs with large girth , 1990, J. Graph Theory.

[18]  Jan Volec,et al.  Fractional colorings of cubic graphs with large girth , 2011, SIAM J. Discret. Math..

[20]  F. Hadlock,et al.  Finding a Maximum Cut of a Planar Graph in Polynomial Time , 1975, SIAM J. Comput..

[21]  N. Wormald.  Differential Equations for Random Processes and Random Graphs , 1995 .

[22]  Robert Šámal.  On XY Mappings , 2006 .

[23]  Maria J. Serna,et al.  Bisection of Random Cubic Graphs , 2002, RANDOM.

[24]  Nicholas J. Higham,et al.  Accuracy and stability of numerical algorithms, Second Edition , 2002 .

[25]  Nicholas C. Wormald,et al.  Induced Forests in Regular Graphs with Large Girth , 2008, Comb. Probab. Comput..

[26]  Maria J. Serna,et al.  Bounds on the max and min bisection of random cubic and random 4-regular graphs , 2003, Theor. Comput. Sci..