Weak quasi‐randomness for uniform hypergraphs

We study quasi-random properties of k-uniform hypergraphs. Our central notion is uniform edge distribution with respect to large vertex sets. We will nd several equivalent characterisations of this property and our work can be viewed as an extension of the well known Chung-Graham-Wilson theorem for quasi-random graphs. Moreover, let Kk be the complete graph on k vertices and M(k) the line graph of the graph of the k-dimensional hypercube. We will show that the pair of graphs (Kk;M(k)) has the property that if the number of copies of both Kk and M(k) in another graph G are as expected in the random graph of density d, then G is quasi-random (in the sense of the Chung-Graham-Wilson theorem) with density close to d.

[1]  Fan Chung Graham,et al.  Quasi-random graphs , 1988, Comb..

[2]  Raphael Yuster,et al.  On the density of a graph and its blowup , 2010, J. Comb. Theory, Ser. B.

[3]  Fan Chung.  Regularity lemmas for hypergraphs and quasi-randomness , 1991 .

[4]  D. Conlon,et al.  An Approximate Version of Sidorenko’s Conjecture , 2010, 1004.4236.

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

[6]  D. Gottlieb.  A certain class of incidence matrices , 1966 .

[7]  Vojtech Rödl,et al.  The algorithmic aspects of the regularity lemma , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  Asaf Shapira.  Quasi-randomness and the distribution of copies of a fixed graph , 2008, Comb..

[9]  Lubos Thoma,et al.  Bipartite Subgraphs and Quasi-Randomness , 2004, Graphs Comb..

[10]  Vojtech Rödl,et al.  The Uniformity Lemma for hypergraphs , 1992, Graphs Comb..

[11]  Fan Chung Graham,et al.  Quasi-Random Hypergraphs , 1990, Random Struct. Algorithms.

[12]  Yohji Akama,et al.  Set systems: Order types, continuous nondeterministic deformations, and quasi-orders , 2011, Theor. Comput. Sci..

[13]  Raphael Yuster,et al.  The effect of induced subgraphs on quasi-randomness , 2008, SODA '08.

[14]  V. Rödl,et al.  Extremal problems on set systems , 2002 .

[15]  Ronald L. Graham,et al.  Cohomological aspects of hypergraphs , 1992 .

[16]  Vojtech Rödl,et al.  On a Packing and Covering Problem , 1985, Eur. J. Comb..

[17]  Miklós Simonovits,et al.  Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs , 1997, Comb..

[18]  W. T. Gowers,et al.  Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs , 2006, Combinatorics, Probability and Computing.

[19]  Domingos Dellamonica,et al.  Hereditary quasirandom properties of hypergraphs , 2011, Comb..

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

[21]  Yoshiharu Kohayakawa,et al.  Hypergraphs, Quasi-randomness, and Conditions for Regularity , 2002, J. Comb. Theory, Ser. A.

[22]  Vojtech Rödl,et al.  Extremal problems on set systems , 2002, Random Struct. Algorithms.

[23]  F. Chung.  Quasi-random classes of hypergraphs , 1990 .

[24]  Hiêp Hàn,et al.  Note on forcing pairs , 2011, Electron. Notes Discret. Math..

[25]  Vojtech Rödl,et al.  Hypergraph regularity and quasi-randomness , 2009, SODA.

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

[27]  A. Thomason.  Pseudo-Random Graphs , 1987 .

[28]  Miklós Simonovits,et al.  Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs , 2003, Combinatorics, Probability and Computing.

[29]  Fan Chung.  Quasi-random hypergraphs revisited† , 2012 .

[30]  Vojtech Rödl,et al.  An Algorithmic Regularity Lemma for Hypergraphs , 2000, SIAM J. Comput..

[31]  Raphael Yuster.  Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets , 2010, Comb..

[32]  Domingos Dellamonica,et al.  Hereditary quasi-random properties of hypergraphs , 2009, Electron. Notes Discret. Math..

[33]  Yoshiharu Kohayakawa,et al.  Weak hypergraph regularity and linear hypergraphs , 2010, J. Comb. Theory, Ser. B.

[34]  R. Graham,et al.  Quasi-random set systems , 1991 .

[35]  Miklós Simonovits,et al.  Szemerédi's Partition and Quasirandomness , 1991, Random Struct. Algorithms.

[36]  Vojtech Rödl,et al.  The Algorithmic Aspects of the Regularity Lemma , 1994, J. Algorithms.

[37]  Hamed Hatami.  Graph norms and Sidorenko’s conjecture , 2008, 0806.0047.