For fixed s, optimal K_s-free pseudorandom graphs would imply r(s,t)=t^{s-1+o(1)}, and new constructions improve the cycle Ramsey lower bounds to r(C5,t) > t^{11/8} and r(C7,t) > t^{11/9}.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A note on pseudorandom Ramsey graphs
For fixed s, optimal K_s-free pseudorandom graphs would imply r(s,t)=t^{s-1+o(1)}, and new constructions improve the cycle Ramsey lower bounds to r(C5,t) > t^{11/8} and r(C7,t) > t^{11/9}.