Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
From MaRDI portal
Publication:1964595
DOI10.1007/s004930050063zbMath0932.05080OpenAlexW2010512224WikidataQ105584593 ScholiaQ105584593MaRDI QIDQ1964595
Vojtěch Rödl, Andrzej Ruciński
Publication date: 21 February 2000
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930050063
Related Items (26)
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Triangle-Tilings in Graphs Without Large Independent Sets ⋮ Perfect matchings in uniform hypergraphs with large minimum degree ⋮ Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree ⋮ Global maker-breaker games on sparse graphs ⋮ Sharpening an ore-type version of the Corrádi-Hajnal theorem ⋮ A Short proof of the blow-up lemma for approximate decompositions ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ A rainbow blow‐up lemma ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ A blow-up lemma for approximate decompositions ⋮ An Ore-type theorem on equitable coloring ⋮ On 2-factors with \(k\) components ⋮ A refinement of a result of Corrádi and Hajnal ⋮ Proof of the bandwidth conjecture of Bollobás and Komlós ⋮ A fast algorithm for equitable coloring ⋮ Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture ⋮ Spanning embeddings of arrangeable graphs with sublinear bandwidth ⋮ Distributing vertices along a Hamiltonian cycle in Dirac graphs ⋮ Ore-type versions of Brooks' theorem ⋮ A fast parallel algorithm for finding Hamiltonian cycles in dense graphs ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs ⋮ Ramsey numbers for bipartite graphs with small bandwidth
This page was built for publication: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
