Fiachra Knox

activity

20102020

most citedPolynomial-time perfect matchings in dense hypergraphs

29 citations · 62 across the 8 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

math.CO2011

Embedding spanning bipartite graphs of small bandwidth

Fiachra Knox, Andrew Treglown

Boettcher, Schacht and Taraz gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and…

math.CO2011★ 13 cited

Edge-disjoint Hamilton cycles in random graphs

Fiachra Knox, Daniela Kühn, Deryk Osthus

We show that provided $lo g^{50} n / n \leq p \leq 1 - n^{- 1/4} lo g^{9} n$ we can with high probability find a collection of $⌊ δ (G) /2 ⌋$ edge-disjoint Hamilton cycles in $…