Quasi-random subsets of Zn
Authors:
- F.R.K. ChungFCF.R.K. Chung
- R.L. GrahamRGR.L. Graham
- 1 September 1992
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 61 (1) , 64-86
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Quasi‐random tournamentsJournal of Graph Theory, 1991
- Szemerédi's partition and quasirandomnessRandom Structures & Algorithms, 1991
- Quasi‐random classes of hypergraphsRandom Structures & Algorithms, 1990
- A Diagonal Form for the Incidence Matrices of t-Subsets vs.k-SubsetsEuropean Journal of Combinatorics, 1990
- On universality of graphs with uniformly distributed edgesDiscrete Mathematics, 1986
- Intersection Theorems for Vector SpacesEuropean Journal of Combinatorics, 1985
- Graphs which Contain all Small GraphsEuropean Journal of Combinatorics, 1981
- A note on constructive methods for ramsey numbersJournal of Graph Theory, 1981
- A Constructive Solution to a Tournament ProblemCanadian Mathematical Bulletin, 1971
- The Art of Computer Programming. Vol. II: Seminumerical AlgorithmsMathematics of Computation, 1970