A hypergraph blow-up lemma
From MaRDI portal
Publication:3094607
DOI10.1002/rsa.20362zbMath1232.05149arXiv1011.1355OpenAlexW1995581755WikidataQ105583256 ScholiaQ105583256MaRDI QIDQ3094607
Publication date: 25 October 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1355
Related Items
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree, Vertex covers by monochromatic pieces -- a survey of results and problems, Counting in hypergraphs via regularity inheritance, Regular slices for hypergraphs, Improved monochromatic loose cycle partitions in hypergraphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, A Short proof of the blow-up lemma for approximate decompositions, Loose Hamilton cycles in hypergraphs, Properly colored Hamilton cycles in Dirac-type hypergraphs, Perfect Packings in Quasirandom Hypergraphs II, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Recent advances on the Hamiltonian problem: survey III, A rainbow blow-up lemma for almost optimally bounded edge-colourings, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Monochromatic bounded degree subgraph partitions, Tight cycles and regular slices in dense hypergraphs, Unnamed Item, Hamilton \(\ell \)-cycles in uniform hypergraphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, A geometric theory for hypergraph matching
Cites Work
- Unnamed Item
- Loose Hamilton cycles in hypergraphs
- A variant of the hypergraph removal lemma
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Szemerédi's lemma for the analyst
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- On the Ramsey number of sparse 3-graphs
- Proof of the Seymour conjecture for large graphs
- Blow-up lemma
- Tiling Turán theorems
- Hypergraphs, quasi-randomness, and conditions for regularity
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- On extremal problems of graphs and generalized graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Weighted sums of certain dependent random variables
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Reflection positivity, rank connectivity, and homomorphism of graphs
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- A hypergraph regularity method for generalized Turán problems
- Embedding large subgraphs into dense graphs
- An algorithmic version of the blow-up lemma
- Regularity properties for triple systems
- Extremal problems on set systems
- Packings in Dense Regular Graphs
- On characterizing hypergraph regularity
- Regularity Lemma for k-uniform hypergraphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4870539 A linear programming perspective on the Frankl?R�dl?Pippenger theorem]
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- Flag algebras
- The counting lemma for regular k‐uniform hypergraphs
- Ramsey numbers of sparse hypergraphs
- Proof of the Alon-Yuster conjecture
