MORE CONSTRUCTIVE LOWER BOUNDS ON CLASSICAL RAMSEY NUMBERS

We present several new constructive lower bounds for classical Ramsey numbers. In particular, the inequality R(k, s+1) ≥ R(k, s)+2k--2 is proved for k ≥ 5. The general construction permits us to prove that, for all integers k, l, with k ≥ 5 and l ≥ 3, the connectivity of any Ramseycritical (k, l)-gr...

Ausführliche Beschreibung