2021/03/30 by Corsten, Jan, Mendonça, Walner
#05C55 (primary) #05C70 (secondary) #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2103.16535
We prove that for all integers Δ,r ≥ 2, there is a constant C = C(Δ,r) >0 such that the following is true for every sequence F = \F1, F2, …\ of graphs with v(Fn) = n and Δ(Fn) ≤ Δ, for each n ∈ ℕ. In every r-edge-coloured Kn, there is a collection of at most C monochromatic copies from F whose vertex-sets partition V(Kn). This makes progress on a conjecture of Grinshpun and Sárközy.