2024/07/11 by Czygrinow, Andrzej, Molla, Theodore, Nagle, Brendan
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2407.08098
Let G = (V,E) be an n-vertex graph and let c: E → ℕ be a coloring of its edges. Let dc(v) be the number of distinct colors on the edges at v ∈ V and let δc(G) = minv ∈ V \ dc(v) \. H. Li proved that δc(G) > n/2 guarantees a rainbow triangle in G. We give extensions of Li's result to cliques Kr for r ≥ 4.