2000 character limit reached
A proof for a conjecture of Gyarfas, Lehel, Sarkozy and Schelp on Berge-cycles
Published 13 Apr 2014 in math.CO | (1404.3385v2)
Abstract: It has been conjectured that for any fixed and sufficiently large , there is a monochromatic Hamiltonian Berge-cycle in every -coloring of the edges of , the complete -uniform hypergraph on vertices. In this paper we prove this conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper.