Regular Partitions of Hypergraphs: Regularity Lemmas
From MaRDI portal
Publication:5428365
DOI10.1017/S0963548307008553zbMath1206.05071OpenAlexW2149616758WikidataQ124966856 ScholiaQ124966856MaRDI QIDQ5428365
Publication date: 22 November 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548307008553
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10)
Related Items
Vertex covers by monochromatic pieces -- a survey of results and problems, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, Counting in hypergraphs via regularity inheritance, Regular slices for hypergraphs, Embedding tetrahedra into quasirandom hypergraphs, The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph, Monochromatic loose path partitions in \(k\)-uniform hypergraphs, Cover \(k\)-uniform hypergraphs by monochromatic loose paths, Bounds for graph regularity and removal lemmas, Improved monochromatic loose cycle partitions in hypergraphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, Extremal problems in uniformly dense hypergraphs, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Hypergraph regularity and random sampling, Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs, Linear Ramsey Numbers for Bounded-Degree Hypergrahps, Minimum degree conditions for tight Hamilton cycles, F$F$‐factors in Quasi‐random Hypergraphs, Loose Hamilton cycles in hypergraphs, Local-vs-global combinatorics, 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, Testable and untestable classes of first-order formulae, A measure-theoretic approach to the theory of dense hypergraphs, Regular partitions of gentle graphs, Multiple recurrence in quasirandom groups, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A sparse regular approximation lemma, Monochromatic bounded degree subgraph partitions, Tight cycles and regular slices in dense hypergraphs, Weak hypergraph regularity and linear hypergraphs, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, The symmetry preserving removal lemma, Hamilton \(\ell \)-cycles in uniform hypergraphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Generalizations of the removal lemma, Testability and repair of hereditary hypergraph properties, On random sampling in uniform hypergraphs, A hypergraph regularity method for generalized Turán problems, What is good mathematics?, Hereditary properties of hypergraphs, On the Ramsey number of sparse 3-graphs, Ramsey numbers of sparse hypergraphs, A hypergraph blow-up lemma, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, A geometric theory for hypergraph matching, From harmonic analysis to arithmetic combinatorics, A tight bound for hypergraph regularity, Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles, Every Monotone 3-Graph Property is Testable, Minimum Vertex Degree Threshold for ‐tiling*
