Random Structures and Algorithms · 1990 · 103 citations · 7 references
Natural SciencesComputer ScienceMathematicsCombinatoricsDiscrete MathematicsTopologyGraph TheoryHypergraph TheoryRandom Graph TheoryRandom Hypergraphs
Abstract We introduce an equivalence class of varied properties for hypergraphs. Any hypergraph possessing any one of these properties must of necessity possess them all. Since almost all random hypergraphs share these properties, we term these properties quasi‐random. With these results, it becomes quite easy to show that many natural explicit constructions result in hypergraphs which imitate random hypergraphs in a variety of ways.
7
Fan Chung, Ronald Graham, R. Wilson · COMBINATORICA · 1989 · 486 citations
A Constructive Solution to a Tournament Problem
Ronald Graham, J. Spencer · Canadian Mathematical Bulletin · 1971 · 122 citations · Full text
Graphs which Contain all Small Graphs
Béla Bollobás, Andrew Thomason · European Journal of Combinatorics · 1981 · 81 citations