Indexed metadata

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

Eng Keat Hng

Source record

Source: arXiv

Published: Oct 29, 2026

arXiv: 2610.39578

Open original source ↗

Source abstract

Let Cn(3)C^{(3)}_n be the 33-uniform tight cycle on nn vertices, that is, the 33-uniform hypergraph on a cyclically ordered set of nn vertices whose edges are precisely the triples of consecutive vertices in the given cyclic order. We asymptotically determine the off-diagonal Ramsey numbers of 33-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 33-uniform tight cycles.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.