Alternating Hamiltonian cycles |
| |
Authors: | Béla Bollobás Paul Erdös |
| |
Institution: | (1) Department of Pure Mathematics, University of Cambridge, Cambridge, England |
| |
Abstract: | Colour the edges of a complete graph withn vertices in such a way that no vertex is on more thank edges of the same colour. We prove that for everyk there is a constantc
ksuch that ifn>c
kthen there is a Hamiltonian cycle with adjacent edges having different colours. We prove a number of other results in the
same vein and mention some unsolved problems. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|