Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs

We describe algorithmic Number On the Forehead protocols that provide dense Ruzsa-Szemeredi graphs. One protocol leads to a simple and natural extension of the original construction of Ruzsa and Szemeredi. The graphs induced by this protocol have $n$ vertices, $\Omega(n^2/\log n)$ edges, and are decomposable into $n^{1+O(1/\log \log n)}$ induced matchings. Another protocol is an explicit (and slightly simpler) version of the construction of Alon, Moitra and Sudakov, producing graphs with similar properties. We also generalize the above protocols to more than three players, in order to construct dense uniform hypergraphs in which every edge lies in a positive small number of simplices.

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

[2]  A. J. W. Hilton,et al.  ERDÖS ON GRAPHS: HIS LEGACY OF UNSOLVED PROBLEMS , 1999 .

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

[4]  J. Rassias.  Solution of a problem of Ulam , 1989 .

[5]  Miklós Simonovits,et al.  Supersaturated graphs and hypergraphs , 1983, Comb..

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  W. T. Gowers,et al.  Hypergraph regularity and the multidimensional Szemerédi theorem , 2007, 0710.3032.

[8]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[9]  József Dénes,et al.  Research problems , 1980, Eur. J. Comb..

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

[11]  P. Erdös.  Problems and results on chromatic numbers in finite and infinite graphs , 1985 .

[12]  Adi Shraibman,et al.  On The Communication Complexity of High-Dimensional Permutations , 2017, ITCS.

[13]  V. Rödl,et al.  The counting lemma for regular k-uniform hypergraphs , 2006 .

[14]  Fan Chung Graham,et al.  An Upper Bound for the Turán Number t3(n,4) , 1999, J. Comb. Theory, Ser. A.

[15]  Vojtech Rödl,et al.  Regularity Lemma for k‐uniform hypergraphs , 2004, Random Struct. Algorithms.

[16]  Paul Erdös,et al.  Problems and results in combinatorial analysis and graph theory , 1988, Discret. Math..

[17]  M. P. Alfaro,et al.  Solution of a problem of P. Tura´n on zeros of orthogonal polynomials on the unit circle , 1988 .

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

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

[20]  P. Erdös.  On Some of my Favourite Problems in Various Branches of Combinatorics , 1992 .

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