σ-algebras for quasirandom hypergraphs
From MaRDI portal
Publication:2951886
DOI10.1002/rsa.20641zbMath1352.05168arXiv1312.4882OpenAlexW2419111809WikidataQ105584948 ScholiaQ105584948MaRDI QIDQ2951886
Publication date: 10 January 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.4882
Related Items
Hamiltonicity in cherry-quasirandom 3-graphs ⋮ Inverse expander mixing for hypergraphs ⋮ Embedding tetrahedra into quasirandom hypergraphs ⋮ How unproportional must a graph be? ⋮ Counting results for sparse pseudorandom hypergraphs. II. ⋮ 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 ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ Quasirandomness in hypergraphs ⋮ Quasi-random words and limits of word sequences ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ Quasirandomness in hypergraphs ⋮ A tight bound for hypergraph regularity ⋮ Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
Cites Work
- A measure-theoretic approach to the theory of dense hypergraphs
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Quasi-random graphs and graph limits
- A functional interpretation for nonstandard arithmetic
- A variant of the hypergraph removal lemma
- Limits of dense graph sequences
- Eigenvalues and extremal degrees of graphs
- Szemerédi's lemma for the analyst
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Weak hypergraph regularity and linear hypergraphs
- Quasi-randomness and the distribution of copies of a fixed graph
- Representations for partially exchangeable arrays of random variables
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Bipartite subgraphs and quasi-randomness
- An approximate logic for measures
- Hypergraph regularity and the multidimensional Szemerédi theorem
- The effect of induced subgraphs on quasi-randomness
- Testability and repair of hereditary hypergraph properties
- Stable group theory and approximate subgroups
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random hypergraphs revisited
- The quasi-randomness of hypergraph cut properties
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi-random hypergraphs
- Graph limits and exchangeable random graphs
- Szemerédi's partition and quasirandomness
- Quasi‐random classes of hypergraphs
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- Extremal problems on set systems
- Regularity Lemma for k-uniform hypergraphs
- The poset of hypergraph quasirandomness
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
- Probabilistic Symmetries and Invariance Principles
- Quasi-random graphs
- A new proof of Szemerédi's theorem
- Unnamed Item
- Unnamed Item
