Weak quasi-randomness for uniform hypergraphs

DOI10.1002/rsa.20389zbMath1236.05137OpenAlexW2108540837MaRDI QIDQ3119042

Yury Person, Mathias Schacht, David Conlon, Hiệp Hàn

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.20389

zbMATH Keywords

regularity lemmahypergraphsquasi-randomnessforcing conjecture for graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65)

Related Items (35)

Finite reflection groups and graph norms ⋮ Inverse expander mixing for hypergraphs ⋮ Quasi-random multilinear polynomials ⋮ How unproportional must a graph be? ⋮ On the density of a graph and its blowup ⋮ An approximate version of Sidorenko's conjecture ⋮ σ-algebras for quasirandom hypergraphs ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ F$F$‐factors in Quasi‐random Hypergraphs ⋮ Spectra of uniform hypergraphs ⋮ Common graphs with arbitrary connectivity and chromatic number ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ Partial associativity and rough approximate groups ⋮ Hereditary quasirandom properties of hypergraphs ⋮ Almost all Steiner triple systems are almost resolvable ⋮ On the KŁR conjecture in random graphs ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ Constructive Packings by Linear Hypergraphs ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ Weak hypergraph regularity and linear hypergraphs ⋮ Unnamed Item ⋮ Quasirandomness in hypergraphs ⋮ Linear quasi-randomness of subsets of abelian groups and hypergraphs ⋮ Linear quasi-randomness of subsets of abelian groups and hypergraphs ⋮ Tournament quasirandomness from local counting ⋮ Note on strong refutation algorithms for random k-SAT formulas ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS ⋮ Quasirandomness in hypergraphs ⋮ Quasi-random hypergraphs revisited ⋮ The quasi-randomness of hypergraph cut properties ⋮ Hereditary quasi-random properties of hypergraphs ⋮ The poset of hypergraph quasirandomness

Cites Work

• Unnamed Item
• On the density of a graph and its blowup
• An approximate version of Sidorenko's conjecture
• Hereditary quasirandom properties of hypergraphs
• Weak hypergraph regularity and linear hypergraphs
• Quasi-randomness and the distribution of copies of a fixed graph
• On a packing and covering problem
• The uniformity lemma for hypergraphs
• Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
• Hypergraphs, quasi-randomness, and conditions for regularity
• Bipartite subgraphs and quasi-randomness
• Hypergraph regularity and the multidimensional Szemerédi theorem
• The effect of induced subgraphs on quasi-randomness
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Quasi-random hypergraphs
• Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
• Szemerédi's partition and quasirandomness
• Quasi‐random classes of hypergraphs
• Regularity lemmas for hypergraphs and quasi-randomness
• Cohomological Aspects of Hypergraphs
• The Algorithmic Aspects of the Regularity Lemma
• Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
• An Algorithmic Regularity Lemma for Hypergraphs
• Extremal problems on set systems
• Quasi-Random Set Systems
• Regularity Lemma for k-uniform hypergraphs
• A Certain Class of Incidence Matrices
• Quasi-random graphs
• Graph norms and Sidorenko's conjecture

This page was built for publication: Weak quasi-randomness for uniform hypergraphs