The poset of hypergraph quasirandomness
From MaRDI portal
Publication:5265346
DOI10.1002/rsa.20521zbMath1328.05172arXiv1208.5978OpenAlexW2150302760WikidataQ105583301 ScholiaQ105583301MaRDI QIDQ5265346
Publication date: 23 July 2015
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.5978
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07)
Related Items
Perfect packings in quasirandom hypergraphs. I., Inverse expander mixing for hypergraphs, Eigenvalues of non-regular linear quasirandom hypergraphs, How unproportional must a graph be?, Counting results for sparse pseudorandom hypergraphs. II., The Erdős-Hajnal hypergraph Ramsey problem, σ-algebras for quasirandom hypergraphs, Concentration estimates for functions of finite high‐dimensional random arrays, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Natural quasirandomness properties, F$F$‐factors in Quasi‐random Hypergraphs, Tiling multipartite hypergraphs in quasi-random hypergraphs, Perfect Packings in Quasirandom Hypergraphs II, Quasirandomness in hypergraphs, Hamilton cycles in quasirandom hypergraphs, Adjacency spectra of random and complete hypergraphs, Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, Quasirandomness in hypergraphs, Ample simplicial complexes
Cites Work
- Unnamed Item
- Unnamed Item
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Quasi-random graphs and graph limits
- A variant of the hypergraph removal lemma
- Eigenvalues and extremal degrees of graphs
- Weak hypergraph regularity and linear hypergraphs
- Quasi-randomness and the distribution of copies of a fixed graph
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Hypergraphs, quasi-randomness, and conditions for regularity
- Sparse quasi-random graphs
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Bipartite subgraphs and quasi-randomness
- The extremal function for noncomplete minors
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Generalized quasirandom graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- The effect of induced subgraphs on quasi-randomness
- Testability and repair of hereditary hypergraph properties
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random hypergraphs revisited
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi-random hypergraphs
- Expander graphs and their applications
- Quasirandom Groups
- A hypergraph regularity method for generalized Turán problems
- Szemerédi's partition and quasirandomness
- Quasi‐random classes of hypergraphs
- Cohomological Aspects of Hypergraphs
- Regular pairs in sparse random graphs I
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- Quasi-Random Set Systems
- Regularity Lemma for k-uniform hypergraphs
- Quasi‐random graphs with given degree sequences
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- Quasi-random graphs
