Off-diagonal Ramsey numbers for 3-uniform tight hypergraph cycles
Eng Keat Hng
Source abstract
Let be the -uniform tight cycle on vertices, that is, the -uniform hypergraph on a cyclically ordered set of vertices whose edges are precisely the triples of consecutive vertices in the given cyclic order. We asymptotically determine the off-diagonal Ramsey numbers of -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 -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.