Papers
Topics
Authors
Recent
Search
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 r≥2r\geq 2 and sufficiently large nn, there is a monochromatic Hamiltonian Berge-cycle in every (r−1)(r-1)-coloring of the edges of KnrK_{n}^{r}, the complete rr-uniform hypergraph on nn vertices. In this paper we prove this conjecture.

Authors (1)
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.