Regular Partitions of Hypergraphs: Regularity Lemmas
From MaRDI portal
Publication:5428365
DOI10.1017/S0963548307008553zbMath1206.05071WikidataQ124966856 ScholiaQ124966856MaRDI QIDQ5428365
Publication date: 22 November 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
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, 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, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, 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
