Local Rainbow Colorings


Given a graph H, we denote by C(n,H) the minimum number k such that following holds: There are n colorings of E(Kn) with k-colors, each associated with one of the vertices of Kn, such that for every copy T of H in Kn, at least one of the colorings that are associated with V (T ) assigns distinct colors to all the edges of E(T ). We characterize the set of… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics