6 citations · 20 across the 19 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Decompositions of edge-coloured infinite complete graphs into monochromatic paths II
Daniel T. Soukup
P. Erdős proved that every 2-edge coloured complete graph on the natural numbers can be vertex decomposed into two monochromatic paths of different colour. This result was extended…
math.CO2015
Decompositions of edge-colored infinite complete graphs into monochromatic paths
M. Elekes, D. T. Soukup, L. Soukup +1
An -edge coloring of a graph or hypergraph is a map . Extending results of Rado and answering questions of Rado, Gyárfás and Sárközy we prove…