Perfect matchings in -regular graphs and the blow-up lemma
From MaRDI portal
Publication:1964595
DOI10.1007/S004930050063zbMATH Open0932.05080OpenAlexW2010512224WikidataQ105584593 ScholiaQ105584593MaRDI QIDQ1964595FDOQ1964595
Authors: 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
Recommendations
- Matchings meeting quotas and their impact on the blow-up lemma
- An algorithmic version of the blow-up lemma
- scientific article; zbMATH DE number 1301962
- K5‐free subgraphs of random graphs
- Holes in graphs
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- Matchings in random biregular bipartite graphs
- Small subsets inherit sparse \(\varepsilon\)-regularity
- Publication:4508359
Cited In (32)
- Triangle-tilings in graphs without large independent sets
- Random perfect matchings in regular graphs
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On 2-factors with \(k\) components
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- Perfect matchings in uniform hypergraphs with large minimum degree
- Sparse partition universal graphs for graphs of bounded degree
- Ore-type versions of Brooks' theorem
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem
- A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Matchings meeting quotas and their impact on the blow-up lemma
- Spanning embeddings of arrangeable graphs with sublinear bandwidth
- On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
- Ramsey numbers for bipartite graphs with small bandwidth
- A blow-up lemma for approximate decompositions
- An extension of the blow-up lemma to arrangeable graphs
- Regular pairs in sparse random graphs I
- Distributing vertices along a Hamiltonian cycle in Dirac graphs
- Global maker-breaker games on sparse graphs
- An Ore-type theorem on equitable coloring
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs
- A rainbow blow-up lemma
- A fast algorithm for equitable coloring
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- A Short proof of the blow-up lemma for approximate decompositions
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth
- Sharpening an ore-type version of the Corrádi-Hajnal theorem
- A refinement of a result of Corrádi and Hajnal
This page was built for publication: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964595)
