Pseudo-random hypergraphs

DOI10.1016/0012-365X(89)90093-9zbMath0800.05009MaRDI QIDQ1812585

Julie Haviland, Andrew G. 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)

Related Items

Lower bound on the size of a quasirandom forcing set of permutations ⋮ On characterizing hypergraph regularity ⋮ Quasi-Random Set Systems ⋮ Quasirandom permutations are characterized by 4-point densities ⋮ Quasi-random multilinear polynomials ⋮ Dense expanders and pseudo-random bipartite graphs ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Quasirandom Latin squares ⋮ The hypergraph regularity method and its applications ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ On pseudo-random subsets of the set of the integers not exceeding \(N\) ⋮ Quasi-random subsets of \(\mathbb{Z}_ n\) ⋮ On testing the `pseudo-randomness' of a hypergraph ⋮ Quasirandomness in hypergraphs ⋮ Characterization of quasirandom permutations by a pattern sum ⋮ No additional tournaments are quasirandom-forcing ⋮ Hypergraphs, quasi-randomness, and conditions for regularity ⋮ Ample simplicial complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The diameter of random regular graphs
• Parallel sorting
• On Ramsey - Turan type theorems for hypergraphs
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
• An extremal function for contractions of graphs
• Imbalances in k‐colorations
• Some remarks on the theory of graphs
• On a problem of K. Zarankiewicz
• Quasi-random graphs