Vertex coverings by monochromatic cycles and trees

doi:10.1016/0095-8956(91)90007-7

Journal of Combinatorial Theory, Series B

Volume 51, Issue 1, January 1991, Pages 90-95

https://doi.org/10.1016/0095-8956(91)90007-7 Get rights and content

Under an Elsevier user license

open archive

Abstract

If the edges of a finite complete graph K are colored with r colors then the vertex set of K can be covered by at most cr²log r vertex disjoint monochromatic cycles. Several related problems are discussed.

Cited by (0)

^∗: Partly supported by the AKA Research Fund of the Hungarian Academy of Sciences.

^†: Research (partially) supported by Hungarian National Foundation for Scientific Research, Grant 1812.