Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
From MaRDI portal
Publication:3373662
DOI10.1017/S0963548305007236zbMath1082.05081OpenAlexW2153710291WikidataQ56675391 ScholiaQ56675391MaRDI QIDQ3373662
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
Szemerédi's regularity lemmaSzemerédi's theorem for arithmetic progressionstheorem of Frankl and Rödl
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05)
Related Items
Finite reflection groups and graph norms, Lower bound on the size of a quasirandom forcing set of permutations, Quasirandom permutations are characterized by 4-point densities, Szemerédi's regularity lemma via martingales, Counting in hypergraphs via regularity inheritance, Embedding tetrahedra into quasirandom hypergraphs, Combinatorial theorems in sparse random sets, A Note on Even Cycles and Quasirandom Tournaments, On the Gowers norms of certain functions, σ-algebras for quasirandom hypergraphs, On 3‐graphs with no four vertices spanning exactly two edges, SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT, Quasirandom-Forcing Orientations of Cycles, Extremal problems in uniformly dense hypergraphs, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Hypergraph regularity and random sampling, Quasirandom Latin squares, A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing, On graph norms for complex‐valued functions, F$F$‐factors in Quasi‐random Hypergraphs, Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL, Tiling multipartite hypergraphs in quasi-random hypergraphs, A new proof of the density Hales-Jewett theorem, Hypergraphs with vanishing Turán density in uniformly dense hypergraphs, Deducing the density Hales-Jewett theorem from an infinitary removal lemma, A new proof of the graph removal lemma, A measure-theoretic approach to the theory of dense hypergraphs, Extremal results in sparse pseudorandom graphs, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, Sparse hypergraphs: new bounds and constructions, Limit densities of patterns in permutation inflations, Semantic limits of dense combinatorial objects, On the KŁR conjecture in random graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Quasirandom Groups, Constructive Packings by Linear Hypergraphs, Note on the 3-graph counting Lemma, Bounding the number of hyperedges in friendship \(r\)-hypergraphs, Hypergraph Independent Sets, On eigenvalues of random complexes, An analytic approach to sparse hypergraphs: hypergraph removal, On \(k\)-uniform random hypergraphs without generalized fans, Stability results for random discrete structures, Weak hypergraph regularity and linear hypergraphs, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, Green’s Conjecture and Testing Linear Invariant Properties, Erdős-Hajnal-type theorems in hypergraphs, The symmetry preserving removal lemma, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, The effect of induced subgraphs on quasi-randomness, Quasirandomness in hypergraphs, Testability and repair of hereditary hypergraph properties, Linear quasi-randomness of subsets of abelian groups and hypergraphs, A hypergraph regularity method for generalized Turán problems, Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems, What is good mathematics?, Quasi-random words and limits of word sequences, Hereditary properties of hypergraphs, Characterization of quasirandom permutations by a pattern sum, A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma, A hypergraph blow-up lemma, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, Combinatorial Problems for Horn Clauses, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS, Quasirandomness in hypergraphs, Weak quasi-randomness for uniform hypergraphs, The quasi-randomness of hypergraph cut properties, From harmonic analysis to arithmetic combinatorics, Quasi-Random Oriented Graphs, A tight bound for hypergraph regularity, No additional tournaments are quasirandom-forcing, The poset of hypergraph quasirandomness
