Quasi-random classes of hypergraphs

We investigate the relations among a number of different graph properties for k-uniformhypergraphs, which are shared by random hypergraphs. Various graph properties form equivalence classes which in turn constitute a natural hierarchy. The analogues for binary functions on k-tuples and for hypergraphs with small density are also considered. Several classes are related to communication complexity and expander graphs.

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

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

[3]  A. Thomason,et al.  Pseudo-random hypergraphs , 1989, Discret. Math..

[4]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

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

[6]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[7]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  Vojtech Rödl.  On universality of graphs with uniformly distributed edges , 1986, Discret. Math..

[9]  Umesh V. Vazirani.  Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources , 1985, STOC '85.

[10]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[11]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[12]  Paul Erdös,et al.  On Ramsey—Turán type theorems for hypergraphs , 1982, Comb..

[13]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[14]  Jean-Pierre Serre,et al.  Linear representations of finite groups , 1977, Graduate texts in mathematics.

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

[16]  R. Graham,et al.  A Constructive Solution to a Tournament Problem , 1971, Canadian Mathematical Bulletin.

[17]  Paul Erdös,et al.  Imbalances in k-colorations , 1971, Networks.

[18]  D. A. Burgess.  On Character Sums and Primitive Roots , 1962 .