Quasi-random set systems

Chung, F. R. K.   ; Graham, R. L.

Journal of the American Mathematical Society, Tome 04 (1991) no. 1, pp. 151-196

Détail

DOI : 10.1090/S0894-0347-1991-1077279-1

Bibliographie

[1] Berge, Claude Hypergraphs 1989

[2] Bollobás, Béla Random graphs 1985

[3] Bollobás, Béla Graph theory 1979

[4] Bollobás, Béla, Thomason, Andrew Graphs which contain all small graphs European J. Combin. 1981 13 15

[5] Bondy, J. A., Murty, U. S. R. Graph theory with applications 1976

[6] Burgess, D. A. On character sums and primitive roots Proc. London Math. Soc. (3) 1962 179 192

[7] Chung, F. R. K. Diameters and eigenvalues J. Amer. Math. Soc. 1989 187 196

[8] Chung, Fan R. K. Quasi-random classes of hypergraphs Random Structures Algorithms 1990 363 382

[9] Chung, Fan R. K. Regularity lemmas for hypergraphs and quasi-randomness Random Structures Algorithms 1991 241 252

[10] Chung, F. R. K., Graham, R. L. Quasi-random hypergraphs Random Structures Algorithms 1990 105 124

[11] Chung, F. R. K., Graham, R. L. Cohomological aspects of hypergraphs Trans. Amer. Math. Soc. 1992 365 388

[12] Chung, F. R. K., Graham, R. L., Wilson, R. M. Quasirandom graphs Proc. Nat. Acad. Sci. U.S.A. 1988 969 970

[13] Chung, F. R. K., Graham, R. L., Wilson, R. M. Quasi-random graphs Combinatorica 1989 345 362

[14] Cvetković, Dragoš M., Doob, Michael, Gutman, Ivan, Torgašev, Aleksandar Recent results in the theory of graph spectra 1988

[15] Cvetković, Dragoš M., Doob, Michael, Sachs, Horst Spectra of graphs 1980 368

[16] Erdős, P., Spencer, J. Imbalances in 𝑘-colorations Networks 1971/72 379 385

[17] Erdős, P., Sós, Vera T. On Ramsey-Turán type theorems for hypergraphs Combinatorica 1982 289 295

[18] Fagin, Ronald Probabilities on finite models J. Symbolic Logic 1976 50 58

[19] Frankl, P., Rödl, V. Some Ramsey-Turán type results for hypergraphs Combinatorica 1988 323 332

[20] Frankl, P., Rödl, V., Wilson, R. M. The number of submatrices of a given type in a Hadamard matrix and related results J. Combin. Theory Ser. B 1988 317 328

[21] Füredi, Z., Komlós, J. The eigenvalues of random symmetric matrices Combinatorica 1981 233 241

[22] Graham, Ronald L., Knuth, Donald E., Patashnik, Oren Concrete mathematics 1994

[23] Graham, R. L., Spencer, J. H. A constructive solution to a tournament problem Canad. Math. Bull. 1971 45 48

[24] Haviland, Julie, Thomason, Andrew Pseudo-random hypergraphs Discrete Math. 1989 255 278

[25] Hu, Sze-Tsen A cohomology theory with higher coboundary operators. I. (Construction of the groups.) Nederl. Akad. Wetensch., Proc. 1949

[26] Moon, John W. Topics on tournaments 1968

[27] Rödl, Vojtěch On universality of graphs with uniformly distributed edges Discrete Math. 1986 125 134

[28] Shannon, C. E. A mathematical theory of communication Bell System Tech. J. 1948

[29] Shelah, Saharon, Spencer, Joel Zero-one laws for sparse random graphs J. Amer. Math. Soc. 1988 97 115

[30] Szemerédi, Endre Regular partitions of graphs 1978 399 401

[31] Thomason, Andrew Random graphs, strongly regular graphs and pseudorandom graphs 1987 173 195

[32] Thomason, Andrew Dense expanders and pseudo-random bipartite graphs Discrete Math. 1989 381 386

[33] Wallis, W. D. Combinatorial designs 1988

[34] Weil, André Variétés abéliennes et courbes algébriques 1948 165

[35] Wilson, Richard M. Cyclotomy and difference families in elementary abelian groups J. Number Theory 1972 17 47

[36] Wilson, R. M. Constructions and uses of pairwise balanced designs 1974 18 41

[37] Wilson, Richard M. A diagonal form for the incidence matrices of 𝑡-subsets vs. 𝑘-subsets European J. Combin. 1990 609 615