skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs
Award ID(s):
1800761
PAR ID:
10106753
Author(s) / Creator(s):
;
Date Published:
Journal Name:
European Journal of Combinatorics
Volume:
79
Issue:
C
ISSN:
0195-6698
Page Range / eLocation ID:
140 to 151
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We prove that every family of (not necessarily distinct) even cycles D_1,...,D_{1.2n-1} on some fixed n-vertex set has a rainbow even cycle (that is, a set of edges from distinct D_i’s, forming an even cycle). This resolves an open problem of Aharoni, Briggs, Holzman and Jiang. Moreover, the result is best possible for every positive integer n. 
    more » « less