𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large monochromatic components in colorings of complete 3-uniform hypergraphs

✍ Scribed by András Gyárfás; Penny Haxell

Book ID
108114081
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
419 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Monochromatic Hamiltonian 3-tight Berge
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
✍ András Gyárfás; Gábor N. Sárközy; Endre Szemerédi 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract Here improving on our earlier results, we prove that there exists an __n__~0~ such that for __n__⩾__n__~0~ in every 2‐coloring of the edges of __K__ 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.