Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs

DOI10.1017/S0963548305007236zbMATH Open1082.05081OpenAlexW2153710291WikidataQ56675391 ScholiaQ56675391MaRDI QIDQ3373662FDOQ3373662

Authors: W. Timothy Gowers 

Publication date: 13 March 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007236

Recommendations

• Regularity lemmas for hypergraphs and quasi-randomness
• The hypergraph regularity method and its applications
• Regularity, uniformity, and quasirandomness
• The counting lemma for regular k‐uniform hypergraphs
• Regularity Lemma for k-uniform hypergraphs

zbMATH Keywords

Szemerédi's regularity lemmaSzemerédi's theorem for arithmetic progressionstheorem of Frankl and Rödl

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Combinatorial probability (60C05) Hypergraphs (05C65)

Cited In (81)

• Hypergraph regularity and random sampling
• On graph norms for complex‐valued functions
• Quasi-random Boolean functions
• A deterministic algorithm for the Frieze-Kannan regularity lemma
• SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT
• Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
• Linear quasi-randomness of subsets of abelian groups and hypergraphs
• An improved bound for regular decompositions of 3-uniform hypergraphs of bounded \(\mathrm{VC}_2\)-dimension
• Forcing generalised quasirandom graphs efficiently
• Equivalent regular partitions of three-uniform hypergraphs
• The question of the collapsibility of random 3-regular graphs
• No additional tournaments are quasirandom-forcing
• On 3‐graphs with no four vertices spanning exactly two edges
• Semantic limits of dense combinatorial objects
• On Laplacians of random complexes
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Finite reflection groups and graph norms
• Limit densities of patterns in permutation inflations
• Testability and repair of hereditary hypergraph properties
• Quasirandomness in hypergraphs
• Quasirandomness in hypergraphs
• Quasi-random words and limits of word sequences
• The poset of hypergraph quasirandomness
• Combinatorial theorems in sparse random sets
• A measure-theoretic approach to the theory of dense hypergraphs
• EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
• Characterization of quasirandom permutations by a pattern sum
• Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems
• Hereditary properties of hypergraphs
• Hypergraph Independent Sets
• Quasi-random oriented graphs
• Quasirandom-Forcing Orientations of Cycles
• On \(k\)-uniform random hypergraphs without generalized fans
• Weak hypergraph regularity and linear hypergraphs
• Regularity properties for triple systems
• Deducing the density Hales-Jewett theorem from an infinitary removal lemma
• 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
• Counting Small Cliques in 3-uniform Hypergraphs
• A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
• Short paths in 3-uniform quasi-random hypergraphs
• A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
• A tight bound for hypergraph regularity
• σ-algebras for quasirandom hypergraphs
• A new proof of the density Hales-Jewett theorem
• Counting in hypergraphs via regularity inheritance
• Embedding tetrahedra into quasirandom hypergraphs
• On the Gowers norms of certain functions
• Counting subgraphs in quasi‐random 4‐uniform hypergraphs
• Erdős-Hajnal-type theorems in hypergraphs
• A new proof of the graph removal lemma
• Lower bound on the size of a quasirandom forcing set of permutations
• Green's conjecture and testing linear invariant properties
• Tiling multipartite hypergraphs in quasi-random hypergraphs
• Extremal results in sparse pseudorandom graphs
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• Constructive Packings by Linear Hypergraphs
• From harmonic analysis to arithmetic combinatorics
• Szemerédi's regularity lemma via martingales
• Combinatorial Problems for Horn Clauses
• Stability results for random discrete structures
• A hypergraph regularity method for generalized Turán problems
• An analytic approach to sparse hypergraphs: hypergraph removal
• On the KŁR conjecture in random graphs
• The quasi-randomness of hypergraph cut properties
• Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs
• Bounding the number of hyperedges in friendship \(r\)-hypergraphs
• A Note on Even Cycles and Quasirandom Tournaments
• The symmetry preserving removal Lemma
• Quasirandom Latin squares
• The effect of induced subgraphs on quasi-randomness
• A hypergraph blow-up lemma
• Weak quasi-randomness for uniform hypergraphs
• What is good mathematics?
• F$F$‐factors in Quasi‐random Hypergraphs
• Note on the 3-graph counting Lemma
• Sparse hypergraphs: new bounds and constructions
• Quasirandom Groups
• Extremal problems in uniformly dense hypergraphs
• Quasirandom permutations are characterized by 4-point densities

This page was built for publication: Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373662)