27 citations · 137 across the 40 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
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…
math.CO2013
Tight Hamilton cycles in random hypergraphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
We give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p=n^{-1+eps} for every eps>0. This partly answers a q…