30 citations · 72 across the 47 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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…
math.CO2009★ 3 cited
On splitting infinite-fold covers
Márton Elekes, Tamás Mátrai, Lajos Soukup
Let be a set, $\ka$ be a cardinal number and let $\iH$ be a family of subsets of which covers each at least $\ka$ times. What assumptions can ensure that $\iH$ can…