On testing the `pseudo-randomness' of a hypergraph

DOI10.1016/0012-365X(92)90324-9zbMath0774.05071OpenAlexW2060934652MaRDI QIDQ1195483

Julie Haviland, Andrew G. Thomason

Publication date: 6 December 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90324-9

zbMATH Keywords

randompseudo-random hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items (3)

Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On pseudo-random subsets of the set of the integers not exceeding \(N\) ⋮ Hypergraphs, quasi-randomness, and conditions for regularity

Cites Work

• Unnamed Item
• Unnamed Item
• On universality of graphs with uniformly distributed edges
• Some Ramsey-Turán type results for hypergraphs
• Pseudo-random hypergraphs
• Dense expanders and pseudo-random bipartite graphs
• Quasi-random hypergraphs
• Imbalances in k‐colorations
• Quasi-random graphs

This page was built for publication: On testing the `pseudo-randomness' of a hypergraph