Premium
Quasi‐random hypergraphs
Author(s) -
Chung F. R. K.,
Graham R. L.
Publication year - 1990
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.3240010108
Subject(s) - hypergraph , equivalence (formal languages) , class (philosophy) , mathematics , variety (cybernetics) , term (time) , combinatorics , random graph , discrete mathematics , computer science , graph , physics , statistics , artificial intelligence , quantum mechanics
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.