4 citations · 7 across the 2 of their papers we have counts for
2 papers
math.CO2013★ 4 cited
Spanning embeddings of arrangeable graphs with sublinear bandwidth
Julia Böttcher, Anusch Taraz, Andreas Würfl
The Bandwidth Theorem of Böttcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small ba…
math.CO2013★ 3 cited
An Extension of the Blow-up Lemma to arrangeable graphs
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz +1
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 severa…