Pseudo-random hypergraphs

DOI10.1016/0012-365X(89)90093-9MaRDI QIDQ1812585zbMATH OpenFDO

Authors Julie Haviland, Andrew Thomason

Publication date 25 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4027516
• On testing the `pseudo-randomness' of a hypergraph
• Quasi-random hypergraphs
• Quasi-random hypergraphs
• Turán's theorem for pseudo-random graphs

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• scientific article; zbMATH DE number 4099367 (Why is no real title available?)
• An extremal function for contractions of graphs
• Imbalances in k‐colorations
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
• On Ramsey - Turan type theorems for hypergraphs
• On a problem of K. Zarankiewicz
• Parallel sorting
• Quasi-random graphs
• Some remarks on the theory of graphs
• The diameter of random regular graphs

Cited in

(25)

• No additional tournaments are quasirandom-forcing
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• On pseudo-random subsets of the set of the integers not exceeding \(N\)
• Quasirandomness in hypergraphs
• Ample simplicial complexes
• scientific article; zbMATH DE number 2196516 (Why is no real title available?)
• Characterization of quasirandom permutations by a pattern sum
• Quasirandom-Forcing Orientations of Cycles
• Pseudo-random properties of self-complementary symmetric graphs
• On characterizing hypergraph regularity
• Quasi-random subsets of \(\mathbb{Z}_ n\)
• Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
• The hypergraph regularity method and its applications
• Forcing generalised quasirandom graphs efficiently
• Dense expanders and pseudo-random bipartite graphs
• Quasi-random multilinear polynomials
• Lower bound on the size of a quasirandom forcing set of permutations
• Forcing quasirandomness with triangles
• Hypergraphs, quasi-randomness, and conditions for regularity
• On testing the `pseudo-randomness' of a hypergraph
• Quasirandom Latin squares
• Quasi-Random Set Systems
• Pseudorandom Graphs in Data Structures
• Quasirandom permutations are characterized by 4-point densities

This page was built for publication: Pseudo-random hypergraphs

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