On testing the `pseudo-randomness' of a hypergraph

DOI10.1016/0012-365X(92)90324-9MaRDI QIDQ1195483zbMATH OpenOpenAlexFDO

Authors Julie Haviland, Andrew 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

pseudo-random hypergraphrandom

Mathematics Subject Classification ID

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

Recommendations

• Pseudo-random hypergraphs
• Quasi-random hypergraphs
• Quasi-random hypergraphs
• scientific article; zbMATH DE number 4099367
• Pseudorandom hypergraph matchings

Cites work

• Dense expanders and pseudo-random bipartite graphs
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• scientific article; zbMATH DE number 4099367 (Why is no real title available?)
• Imbalances in k‐colorations
• On universality of graphs with uniformly distributed edges
• Pseudo-random hypergraphs
• Quasi-random graphs
• Quasi-random hypergraphs
• Some Ramsey-Turán type results for hypergraphs

Cited in

(6)

• Hypergraphs, quasi-randomness, and conditions for regularity
• Pseudo-random hypergraphs
• On pseudo-random subsets of the set of the integers not exceeding \(N\)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Random hypergraphs in pseudofinite fields
• Cycle type in Hall-Paige: a proof of the Friedlander-Gordon-Tannenbaum conjecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195483)