Quasi-random hypergraphs revisited
From MaRDI portal
Publication:3119043
DOI10.1002/rsa.20388zbMath1236.05179OpenAlexW2024958583MaRDI QIDQ3119043
Publication date: 7 March 2012
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20388
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)
Related Items
Inverse expander mixing for hypergraphs ⋮ σ-algebras for quasirandom hypergraphs ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ Linear quasi-randomness of subsets of abelian groups and hypergraphs ⋮ Random walks on simplicial complexes and harmonics ⋮ EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS ⋮ The poset of hypergraph quasirandomness
Cites Work
- Hypergraphs, quasi-randomness, and conditions for regularity
- Weak quasi-randomness for uniform hypergraphs
- Quasi‐random classes of hypergraphs
- Cohomological Aspects of Hypergraphs
- Counting subgraphs in quasi‐random 4‐uniform hypergraphs
- Quasi-Random Set Systems
- Communication Complexity and Quasi Randomness
- Quasi-random graphs