Author:
ŁUCZAK TOMASZ,RÖDL VOJTĚCH,SZEMERÉDI ENDRE
Abstract
We prove that there exists n0, such that, for
every
n[ges ]n0 and every 2-colouring of the
edges of the complete graph Kn,
one can find two vertex-disjoint monochromatic cycles of
different colours which cover all vertices of Kn.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献