32 citations · 98 across the 35 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012
Partitioning edge-coloured complete graphs into monochromatic cycles and paths
Alexey Pokrovskiy
A conjecture of Erdős, Gyárfás, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monoch…
math.CO2012
Edge growth in graph powers
Alexey Pokrovskiy
For a graph G, its rth power G^r has the same vertex set as G, and has an edge between any two vertices within distance r of each other in G. We give a lower bound for the number o…