Nearly complete graphs decomposable into large induced matchings and their applications

We describe two constructions of (very) dense graphs which are edge disjoint unions of large induced matchings. The first construction exhibits graphs on N vertices with (N2)-o(N2) edges, which can be decomposed into pairwise disjoint induced matchings, each of size N1-o(1). The second construction provides a covering of all edges of the complete graph KN by two graphs, each being the edge disjoint union of at most N2-δ induced matchings, where δ>0.076. This disproves (in a strong form) a conjecture of Meshulam, substantially improves a result of Birk, Linial and Meshulam on communicating over a shared channel, and (slightly) extends the analysis of Hastad and Wigderson of the graph test of Samorodnitsky and Trevisan for linearity. Additionally, our constructions settle a combinatorial question of Vempala regarding a candidate rounding scheme for the directed Steiner tree problem.

[1]  Jacob Fox,et al.  On a problem of Erdös and Rothschild on edges in triangles , 2012, Comb..

[2]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[3]  N. S. Barnett,et al.  Private communication , 1969 .

[4]  Jacob Fox,et al.  A new proof of the graph removal lemma , 2010, ArXiv.

[5]  Paul Erdös,et al.  On some extremal problems on r-graphs , 1971, Discret. Math..

[6]  David A. Mix Barrington,et al.  Representing Boolean functions as polynomials modulo composite numbers , 1992, STOC '92.

[7]  David A. Mix Barrington,et al.  Representing Boolean functions as polynomials modulo composite numbers , 1994, computational complexity.

[8]  F. Harary.  New directions in the theory of graphs , 1973 .

[9]  Nathan Linial,et al.  On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels , 1993, IEEE Trans. Inf. Theory.

[10]  Noga Alon,et al.  A characterization of easily testable induced subgraphs , 2004, SODA '04.

[11]  Noga Alon,et al.  Testing perfection is hard , 2011, ArXiv.

[12]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[13]  Noga Alon.  Testing subgraphs in large graphs , 2002, Random Struct. Algorithms.

[14]  Vojtech Rödl,et al.  The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..

[15]  Avi Wigderson,et al.  Simple analysis of graph tests for linearity and PCP , 2003, Random Struct. Algorithms.

[16]  Noga Alon,et al.  On An Extremal Hypergraph Problem Of Brown, Erdős And Sós , 2006, Comb..

[17]  Noga Alon,et al.  Testing subgraphs in directed graphs , 2003, STOC '03.

[18]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

[19]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[20]  Samir Khuller,et al.  On directed Steiner trees , 2002, SODA '02.

[21]  T. Sanders.  On Roth's theorem on progressions , 2010, 1011.0104.

[22]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[23]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[24]  W. G. Brown,et al.  On the existence of triangulated spheres in 3-graphs, and related problems , 1973 .

[25]  R. Salem,et al.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1942, Proceedings of the National Academy of Sciences of the United States of America.

[26]  Nitin H. Vaidya,et al.  Multiparty Equality Function Computation in Networks with Point-to-Point Links , 2011, SIROCCO.

[27]  Avi Wigderson,et al.  Simple analysis of graph tests for linearity and PCP , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[28]  P. Erdijs.  ON SOME EXTREMAL PROBLEMS ON r-GRAPHS , 1971 .