One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage All Access membership.
Published in last 50 years
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 2log r vertex disjoint monochromatic cycles. Several related problems are discussed.