Here improving on our earlier results we prove that there exists an n0 such that for n ¸ n0, in every 2-coloring of the edges of K(4) n there is a monochromatic Hamiltonian 3-tight Berge cycle. This proves the c = 2, t = 3, r = 4 special case of a conjecture from .
, Sárközy, Gábor N.
, Szemerédi, Endre
(2008). Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. .
Retrieved from: https://digitalcommons.wpi.edu/computerscience-pubs/31