OpenAlex
An Extension of the Blow-up Lemma to Arrangeable Graphs
Work
Year: 2015
Type: article
Abstract: The blow-up lemma established by Komlós, Sárközy, and Szemerédi in 1997 is an important tool for the embedding of spanning subgraphs of bounded maximum degree. Here we prove several generalizations of... more
Source: SIAM Journal on Discrete Mathematics
Authors Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz, Andreas Würfl
Institutions London School of Economics and Political Science, Technical University of Munich
Cites: 29
Cited by: 19
Related to: 10
FWCI: 2.336
Citation percentile (by year/subfield): 85.05
Topic: Limits and Structures in Graph Theory
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green