An algorithmic version of the blow-up lemma
From MaRDI portal
Publication:4240605
DOI<297::AID-RSA5>3.0.CO;2-Q 10.1002/(SICI)1098-2418(199805)12:3<297::AID-RSA5>3.0.CO;2-QzbMath0917.05071arXivmath/9612213OpenAlexW2020236981WikidataQ105609523 ScholiaQ105609523MaRDI QIDQ4240605
Gábor N. Sárközy, János Komlós, Endre Szemerédi
Publication date: 2 August 1999
Full work available at URL: https://arxiv.org/abs/math/9612213
Related Items
Improved monochromatic double stars in edge colorings, Monochromatic cycle power partitions, An improved bound for the monochromatic cycle partition number, Large monochromatic components in edge colored graphs with a minimum degree condition, Improved monochromatic loose cycle partitions in hypergraphs, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, On sufficient conditions for spanning structures in dense graphs, Approximate multipartite version of the Hajnal-Szemerédi theorem, Sparse partition universal graphs for graphs of bounded degree, Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth, Combinatorial and computational aspects of graph packing and graph decomposition, On a tiling conjecture of Komlós for 3-chromatic graphs., Hamilton cycles in dense vertex-transitive graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, On embedding well-separable graphs, Monochromatic bounded degree subgraph partitions, On 2-factors with \(k\) components, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, How to avoid using the regularity Lemma: Pósa's conjecture revisited, An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs, Spanning embeddings of arrangeable graphs with sublinear bandwidth, Distributing vertices along a Hamiltonian cycle in Dirac graphs, The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle, Proof of a tiling conjecture of Komlós, Multipartite Ramsey numbers for odd cycles, Matchings with few colors in colored complete graphs and hypergraphs, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, Ramsey Number of a Connected Triangle Matching, A hypergraph blow-up lemma, Monochromatic square-cycle and square-path partitions, Cycle factors in dense graphs, Embedding Graphs Having Ore-Degree at Most Five, Large planar subgraphs in dense graphs, An Extension of the Blow-up Lemma to Arrangeable Graphs, Ramsey numbers for bipartite graphs with small bandwidth
