4 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
Andras Gyarfas, Gabor N. Sarkozy
In this paper we consider properly edge-colored graphs, i.e. two edges with the same color cannot share an endpoint, so each color class is a matching. A matching is called \it rai…