Regular Partitions of Hypergraphs: Regularity Lemmas

DOI10.1017/S0963548307008553zbMath1206.05071WikidataQ124966856 ScholiaQ124966856MaRDI QIDQ5428365

Vojtěch Rödl, Mathias Schacht

Publication date: 22 November 2007

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

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

05D05: Extremal set theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05D10: Ramsey theory

Related Items

The symmetry preserving removal lemma, On random sampling in uniform hypergraphs, What is good mathematics?, From harmonic analysis to arithmetic combinatorics, Ramsey numbers of sparse hypergraphs, A new proof of the density Hales-Jewett theorem, Testable and untestable classes of first-order formulae, A measure-theoretic approach to the theory of dense hypergraphs, Loose Hamilton cycles in hypergraphs, Weak hypergraph regularity and linear hypergraphs, Hamilton \(\ell \)-cycles in uniform hypergraphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Generalizations of the removal lemma, Hereditary properties of hypergraphs, On the Ramsey number of sparse 3-graphs, Bounds for graph regularity and removal lemmas, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition, Testability and repair of hereditary hypergraph properties, A hypergraph blow-up lemma, Every Monotone 3-Graph Property is Testable, Linear Ramsey Numbers for Bounded-Degree Hypergrahps, A hypergraph regularity method for generalized Turán problems