6 citations · 10 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018★ 6 cited
A Rainbow Dirac's Theorem
Matthew Coulson, Guillem Perarnau
A famous theorem of Dirac states that any graph on vertices with minimum degree at least has a Hamilton cycle. Such graphs are called Dirac graphs. Strengthening this res…
math.CO2018
Rainbow factors in hypergraphs
Matthew Coulson, Peter Keevash, Guillem Perarnau +1
For any -graph , we consider the problem of finding a rainbow -factor in an -graph with large minimum -degree and an edge-colouring that is suitably bounded.…