Equivalent Conditions for Regularity (Extended Abstract)
暂无分享,去创建一个
[1] Andrew Thomason,et al. On testing the 'pseudo-randomness' of a hypergraph , 1992, Discret. Math..
[2] Fan Chung Graham,et al. Quasi-Random Classes of Hypergraphs , 1990, Random Struct. Algorithms.
[3] R. Graham,et al. Quasi-random set systems , 1991 .
[4] S. Lang. Number Theory III , 1991 .
[5] Yoshiharu Kohayakawa,et al. Equivalent conditions for regularity , 2000 .
[6] Fan Chung Graham,et al. Communication Complexity and Quasi Randomness , 1993, SIAM J. Discret. Math..
[7] B. Bollobás. Surveys in Combinatorics , 1979 .
[8] Fan Chung Graham,et al. Quasi-Random Hypergraphs , 1990, Random Struct. Algorithms.
[9] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[10] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..
[11] Richard M. Wilson,et al. Cyclotomy and difference families in elementary abelian groups , 1972 .
[12] Vojtech Rödl,et al. The Uniformity Lemma for hypergraphs , 1992, Graphs Comb..
[13] Andrew Thomason,et al. Pseudo-random hypergraphs , 1989, Discret. Math..