Off-diagonal Ramsey numbers for 3-uniform tight hypergraph cycles

Let $C^{(3)}_n$ be the $3$-uniform tight cycle on $n$ vertices, that is, the $3$-uniform hypergraph on a cyclically ordered set of $n$ vertices whose edges are precisely the triples of consecutive vertices in the given cyclic order. We asymptotically determine the off-diagonal Ramsey numbers of $3$-uniform tight cycles. This is an off-diagonal analogue of a result of Haxell, Łuczak, Peng, Rödl, Ruciński and Skokan [Combin.\ Probab.\ Comput.\ 18 (2009), no.\ 1-2, 165--203] on the diagonal Ramsey numbers of $3$-uniform tight cycles.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.39578
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Off-diagonal Ramsey numbers for 3-uniform tight hypergraph cycles

Eng Keat Hng
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

Off-diagonal Ramsey numbers for 3-uniform tight hypergraph cycles

Eng Keat Hng
preprint en

Abstract

Let $C^{(3)}_n$ be the $3$-uniform tight cycle on $n$ vertices, that is, the $3$-uniform hypergraph on a cyclically ordered set of $n$ vertices whose edges are precisely the triples of consecutive vertices in the given cyclic order. We asymptotically determine the off-diagonal Ramsey numbers of $3$-uniform tight cycles. This is an off-diagonal analogue of a result of Haxell, Łuczak, Peng, Rödl, Ruciński and Skokan [Combin.\ Probab.\ Comput.\ 18 (2009), no.\ 1-2, 165--203] on the diagonal Ramsey numbers of $3$-uniform tight cycles.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Off-diagonal Ramsey numbers for 3-uniform tight hypergraph cycles — Eng Keat Hng · arXiv (Cornell University) (2026) | TGRS Research Map | TGRS