Coupon coloring of Kneser graph K(n,2)
Mehrnoosh Shadravan, R. A. Borzooei · Discrete Mathematics Algorithms and Applications · 2023
Chen et al. [On coupon coloring of graphs, Discrete Appl. Math. 193 (2015) 94–101] had introduced the concept of coupon coloring for any graph with no isolated vertex. A [Formula: see text]-coupon coloring of [Formula: see text] is an assignment of colors from [Formula: see text] to the vertices of [Formula: see text] such that the neighborhood of every vertex of [Formula: see text] contains vertices of all colors from [Formula: see text]. The maximum [Formula: see text] for which a [Formula: see text]-coupon coloring exists is called the coupon coloring number of [Formula: see text], and is denoted by [Formula: see text]. In this paper, we determine the coupon coloring number of Kneser graphs [Formula: see text].