Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs

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 (P. Dorbec, S. Gravier, and G. N. Sárközy, J...

Full description

Saved in:
Bibliographic Details
Published inJournal of graph theory Vol. 63; no. 4; pp. 288 - 299
Main Authors Gyárfás, András, Sárközy, Gábor N., Szemerédi, Endre
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.04.2010
Subjects
Berge-cycle
Hamiltonian
hypergraph
Online AccessGet full text

Cover

More Information
Summary: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 (P. Dorbec, S. Gravier, and G. N. Sárközy, J Graph Theory 59 (2008), 34–44). © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 288–299, 2010
Bibliography:Janos Bolyai Research Scholarship (to G. N. S.)
istex:81D94FB538EC1622DB25F2071F4EC7BAB321C6AB
ark:/67375/WNG-SCP60H4J-1
National Science Foundation - No. DMS-0456401
Ellentuck Fund (to E. S.)
OTKA - No. K68322 (to A. G. and G. N. S.)
ArticleID:JGT20427
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.20427