Here we prove that for n ¸ 140, in every 3-coloring of the edges of K(4) n there is a monochromatic Berge cycle of length at least n¡10. This result sharpens an asymptotic result obtained earlier. Another result is that for n ¸ 15, in every 2-coloring of the edges of K(4) n there is a 3-tight Berge cycle of length at least n ¡ 10.
, Sárközy, Gábor N.
, Szemerédi, Endre
(2008). Long monochromatic Berge cycles in colored 4-uniform hypergraphs. .
Retrieved from: http://digitalcommons.wpi.edu/computerscience-pubs/34