“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
Paper IPM / M / 14712  


Abstract:  
It has been conjectured that for any fixed r and sufficiently large n, there is a monochromatic
Hamiltonian Bergecycle in every (r â 1)coloring of the edges of Krn, the complete
runiform hypergraph on n vertices. In this paper, we show that the statement of this
conjecture is true with r â 2 colors (instead of r â 1 colors) by showing that there is a
monochromatic Hamiltonian ttight Bergecycle in every â râ2
tâ1 âedgecoloring of Krn
for any
fixed r > t â¥ 2 and sufficiently large n. Also, we give a proof for this conjecture when r = 4
(the first open case). These results improve the previously known results in Dorbec et al.
(2008) and GyÃ¡rfÃ¡s et al. (2008, 2010).
Download TeX format 

back to top 