On graphs decomposable into induced matchings of linear sizes

We call a graph $G$ an $(r,t)$-Ruzsa-Szemer\'edi graph if its edge set can be partitioned into $t$ edge-disjoint induced matchings, each of size $r$. These graphs were introduced in 1978 and has been extensively studied since then. In this paper, we consider the case when $r=cn$. For $c>1/4$, we determine the maximum possible $t$ which is a constant depending only on $c$. On the other hand, when $c=1/4$, there could be as many as $\Omega(\log n)$ induced matchings. We prove that this bound is tight up to a constant factor. Finally, when $c$ is fixed strictly between $1/5$ and $1/4$, we give a short proof that the number $t$ of induced matchings is $O(n/\log n)$. We are also able to further improve the upper bound to $o(n/\log n)$ for fixed $c> 1/4-b$ for some positive constant $b$.

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

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

[3]  P. Bahr,et al.  Sampling: Theory and Applications , 2020, Applied and Numerical Harmonic Analysis.

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

[5]  Thomas F. Bloom,et al.  A quantitative improvement for Roth's theorem on arithmetic progressions , 2014, J. Lond. Math. Soc..

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

[7]  F. Behrend.  On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.

[8]  David Conlon,et al.  Graph removal lemmas , 2012, Surveys in Combinatorics.

[9]  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.

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

[11]  Sofya Raskhodnikova.  Property testing: theory and applications , 2003 .

[12]  Noga Alon,et al.  Nearly complete graphs decomposable into large induced matchings and their applications , 2011, STOC '12.

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

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

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

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

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

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

[19]  K. F. Roth.  On Certain Sets of Integers , 1953 .

[20]  Noga Alon,et al.  Testing subgraphs in large graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[21]  Morris Plotkin,et al.  Binary codes with specified minimum distance , 1960, IRE Trans. Inf. Theory.

[22]  Zoltán Füredi,et al.  Colored packing of sets , 1987 .

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

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