论文信息 - Hypergraphs, Quasi-randomness, and Conditions for Regularity

Hypergraphs, Quasi-randomness, and Conditions for Regularity

Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung and Graham considered several quite disparate properties of random-like hypergraphs of density 1/2 and proved that they are in fact equivalent. The central concept in their work turned out to be the so called deviation of a hypergraph. They proved that having small deviation is equivalent to a variety of other properties that describe quasi-randomness. In this paper, we consider the concept of discrepancy for k-uniform hypergraphs with an arbitrary constant density d (0

[1] Andrew Thomason,et al. Pseudo-random hypergraphs , 1989, Discret. Math..

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

[3] Richard M. Wilson,et al. Cyclotomy and difference families in elementary abelian groups , 1972 .

[4] Vojtech Rödl,et al. On characterizing hypergraph regularity , 2002, Random Struct. Algorithms.

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

[6] Fan Chung Graham,et al. Communication Complexity and Quasi Randomness , 1993, SIAM J. Discret. Math..

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

[8] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

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

[10] Andrew Thomason,et al. On testing the 'pseudo-randomness' of a hypergraph , 1992, Discret. Math..

[11] S. Lang. Number Theory III , 1991 .

[12] Yoshiharu Kohayakawa,et al. An Optimal Algorithm for Checking Regularity , 2003, SIAM J. Comput..