Quasi‐random hypergraphs

Fan Chung, R. L. Graham

Random Structures and Algorithms · 1990 · 103 citations · 7 references

Concepts

Abstract

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.

References

7