σ-algebras for quasirandom hypergraphs
From MaRDI portal
Publication:2951886
Abstract: We examine the correspondence between the various notions of quasirandomness for k-uniform hypergraphs and sigma-algebras related to measurable hypergraphs. This gives a uniform formulation of most of the notions of quasirandomness for dense hypergraphs which have been studied, with each notion of quasirandomness corresponding to a sigma-algebra defined by a collection of subsets of [1,k]. We associate each notion of quasirandomness I with a collection of hypergraphs, the I-adapted hypergraphs, so that G is quasirandom exactly when it contains roughly the correct number of copies of each I-adapted hypergraph. We then identify, for each I, a particular I-adapted hypergraph M_k[I] with the property that if G contains roughly the correct number of copies of M_k[I] then G is quasirandom in the sense of I. This generalizes recent results of Kohayakawa, Nagle, R"odl, and Schacht; Conlon, H`an, Person, and Schacht; and Lenz and Mubayi giving this result for some notions of quasirandomness.
Recommendations
- Hypergraphs, quasi-randomness, and conditions for regularity
- Quasi‐random classes of hypergraphs
- The poset of hypergraph quasirandomness
- Quasirandomness in hypergraphs
- Quasirandomness in hypergraphs
- Quasi-random hypergraphs revisited
- Quasi-random hypergraphs
- Quasi-random hypergraphs
- Quasi-randomness and the regularity method in hypergraphs
Cites work
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- A functional interpretation for nonstandard arithmetic
- A measure-theoretic approach to the theory of dense hypergraphs
- A new proof of Szemerédi's theorem
- A variant of the hypergraph removal lemma
- An approximate logic for measures
- Bipartite subgraphs and quasi-randomness
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Eigenvalues and extremal degrees of graphs
- Eigenvalues and linear quasirandom hypergraphs
- Extremal problems on set systems
- Graph limits and exchangeable random 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 3657792 (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
- Limits of dense graph sequences
- Probabilistic Symmetries and Invariance Principles
- Quasi-random graphs
- Quasi-random graphs and graph limits
- Quasi-random hypergraphs
- Quasi-random hypergraphs revisited
- 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
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi‐random classes of hypergraphs
- Regularity Lemma for k-uniform hypergraphs
- Representations for partially exchangeable arrays of random variables
- Stable group theory and approximate subgroups
- Szemerédi's lemma for the analyst
- Szemerédi's partition and quasirandomness
- Testability and repair of hereditary hypergraph properties
- The poset of hypergraph quasirandomness
- The quasi-randomness of hypergraph cut properties
- Weak hypergraph regularity and linear hypergraphs
- Weak quasi-randomness for uniform hypergraphs
Cited in
(26)- How unproportional must a graph be?
- Hamiltonicity in cherry-quasirandom 3-graphs
- A tight bound for hypergraph regularity
- Counting results for sparse pseudorandom hypergraphs. II.
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Inverse expander mixing for hypergraphs
- Embedding tetrahedra into quasirandom hypergraphs
- Forcing quasirandomness with triangles
- An analytic approach to sparse hypergraphs: hypergraph removal
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
- Perfect Packings in Quasirandom Hypergraphs II
- Quasirandomness in hypergraphs
- Quasi-random words and limits of word sequences
- 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
- Dirac-type conditions for spanning bounded-degree hypertrees
- Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs
- Transversals via regularity
- Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
- Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links
- Weak randomness in graphons and theons
- A removal lemma for ordered hypergraphs
This page was built for publication: σ-algebras for quasirandom hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2951886)
