A hypergraph blow-up lemma
From MaRDI portal
Abstract: We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of embedding bounded degree hypergraphs.
Recommendations
Cites work
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- A hypergraph regularity method for generalized Turán problems
- A linear programming perspective on the Frankl?R�dl?Pippenger theorem
- A variant of the hypergraph removal lemma
- An algorithmic version of the blow-up lemma
- An approximate Dirac-type theorem for k-uniform hypergraphs
- An exact minimum degree condition for Hamilton cycles in oriented graphs
- Blow-up lemma
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- Embedding large subgraphs into dense graphs
- Extremal problems on set systems
- Flag algebras
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs, quasi-randomness, and conditions for regularity
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Loose Hamilton cycles in hypergraphs
- On characterizing hypergraph regularity
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- On extremal problems of graphs and generalized graphs
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- On the Ramsey number of sparse 3-graphs
- Packings in Dense Regular Graphs
- Proof of the Alon-Yuster conjecture
- Proof of the Seymour conjecture for large graphs
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Ramsey numbers of sparse hypergraphs
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Regular Partitions of Hypergraphs: Counting Lemmas
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regularity Lemma for k-uniform hypergraphs
- Regularity properties for triple systems
- Szemerédi's lemma for the analyst
- The counting lemma for regular k‐uniform hypergraphs
- Tiling Turán theorems
- Weighted sums of certain dependent random variables
Cited in
(27)- Duplication of directed graphs and exponential blow up of proofs
- Blow-up lemma
- Recent advances on the Hamiltonian problem: survey III
- A Short proof of the blow-up lemma for approximate decompositions
- Properly colored Hamilton cycles in Dirac-type hypergraphs
- Vertex covers by monochromatic pieces -- a survey of results and problems
- Packing \(k\)-partite \(k\)-uniform hypergraphs
- Counting in hypergraphs via regularity inheritance
- Regular slices for hypergraphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Improved monochromatic loose cycle partitions in hypergraphs
- The Blow-up Lemma
- Hypergraph Packing and Graph Embedding
- Monochromatic bounded degree subgraph partitions
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Tight cycles and regular slices in dense hypergraphs
- Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
- Perfect Packings in Quasirandom Hypergraphs II
- Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
- A geometric theory for hypergraph matching
- Loose Hamilton cycles in hypergraphs
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Transversals via regularity
- Packing k-partite k-uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
This page was built for publication: A hypergraph blow-up lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094607)
