For every k≥4 and C>1 there is a linear k-uniform hypergraph H with off-diagonal Ramsey number r(H,K_n^{(k)}) at least the (k-2)-fold tower of 2^{(log n)^C}.
The girth Ramsey theorem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Given a hypergraph $F$ and a number of colours $r$, there exists a hypergraph $H$ of the same girth satisfying $H\longrightarrow (F)_r$. Moreover, for every linear hypergraph $F$ there exists a Ramsey hypergraph $H$ that locally looks like a forest of copies of $F$.
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Off-Diagonal Ramsey Numbers for Linear Hypergraphs
For every k≥4 and C>1 there is a linear k-uniform hypergraph H with off-diagonal Ramsey number r(H,K_n^{(k)}) at least the (k-2)-fold tower of 2^{(log n)^C}.