New lower bounds r_odd(n, K_{s,t}) > n^{1/(s/2 + 1/(2 floor(t/8)))} for odd s even t, r_u(n, C_n) > n/4 creating a polynomial gap, and odd-Ramsey number of Hamilton cycles >1 in super-Dirac graphs.
Some remarks on the theory of graphs.Bulletin of the American Mathematical Society, 53:292–294, 1947
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
New results on the odd- and unique-Ramsey numbers
New lower bounds r_odd(n, K_{s,t}) > n^{1/(s/2 + 1/(2 floor(t/8)))} for odd s even t, r_u(n, C_n) > n/4 creating a polynomial gap, and odd-Ramsey number of Hamilton cycles >1 in super-Dirac graphs.