The poset of hypergraph quasirandomness
From MaRDI portal
Publication:5265346
Abstract: Chung and Graham began the systematic study of k-uniform hypergraph quasirandom properties soon after the foundational results of Thomason and Chung-Graham-Wilson on quasirandom graphs. One feature that became apparent in the early work on k-uniform hypergraph quasirandomness is that properties that are equivalent for graphs are not equivalent for hypergraphs, and thus hypergraphs enjoy a variety of inequivalent quasirandom properties. In the past two decades, there has been an intensive study of these disparate notions of quasirandomness for hypergraphs, and an open problem that has emerged is to determine the relationship between them. Our main result is to determine the poset of implications between these quasirandom properties. This answers a recent question of Chung and continues a project begun by Chung and Graham in their first paper on hypergraph quasirandomness in the early 1990's.
Recommendations
Cites work
- A hypergraph regularity method for generalized Turán problems
- A variant of the hypergraph removal lemma
- Applications of the regularity lemma for uniform hypergraphs
- Bipartite subgraphs and quasi-randomness
- Cohomological Aspects of Hypergraphs
- Eigenvalues and extremal degrees of graphs
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Expander graphs and their applications
- Generalized quasirandom graphs
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- scientific article; zbMATH DE number 3523693 (Why is no real title available?)
- scientific article; zbMATH DE number 1870233 (Why is no real title available?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs, quasi-randomness, and conditions for regularity
- Quasi-random graphs
- Quasi-random graphs and graph limits
- Quasi-random hypergraphs
- Quasi-random hypergraphs revisited
- Quasi-Random Set Systems
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
- Quasi-randomness and the distribution of copies of a fixed graph
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Quasirandom Groups
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi‐random classes of hypergraphs
- Quasi‐random graphs with given degree sequences
- Regular pairs in sparse random graphs I
- Regularity Lemma for k-uniform hypergraphs
- Sparse quasi-random graphs
- Szemerédi's partition and quasirandomness
- Testability and repair of hereditary hypergraph properties
- The counting lemma for regular k‐uniform hypergraphs
- The extremal function for noncomplete minors
- Weak hypergraph regularity and linear hypergraphs
- Weak quasi-randomness for uniform hypergraphs
Cited in
(27)- Quasi-ultrametrics and their \(2\)-ball hypergraphs
- How unproportional must a graph be?
- Ample simplicial complexes
- The Erdős-Hajnal hypergraph Ramsey problem
- Adjacency spectra of random and complete hypergraphs
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Counting results for sparse pseudorandom hypergraphs. II.
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Perfect packings in quasirandom hypergraphs. I.
- Inverse expander mixing for hypergraphs
- Hamilton cycles in quasirandom hypergraphs
- σ-algebras for quasirandom hypergraphs
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random hypergraphs revisited
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Perfect Packings in Quasirandom Hypergraphs II
- Eigenvalues and linear quasirandom hypergraphs
- Quasirandomness in hypergraphs
- Quasirandomness in hypergraphs
- Concentration estimates for functions of finite high‐dimensional random arrays
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Natural quasirandomness properties
- FF‐factors in Quasi‐random Hypergraphs
- Hereditary quasirandom properties of hypergraphs
- Transversals via regularity
- Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
- Weak randomness in graphons and theons
This page was built for publication: The poset of hypergraph quasirandomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265346)
