University of Cambridge > Talks.cam > Combinatorics Seminar > Multicolour Ramsey Numbers of Odd Cycles

Multicolour Ramsey Numbers of Odd Cycles

Add to your list(s) Download to your calendar using vCal

  • UserNick Day (QMUL)
  • ClockThursday 16 June 2016, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

We show that for any positive integer r there exists an integer k and a k-colouring of the complete graph of order 2k+ 1 such that the colouring contains no monochromatic odd cycle of length less than r. This answers a question of ErdÅ‘s and Graham. We use these colourings to give new lower bounds on the k-colour Ramsey number of the odd cycle and prove that, for all odd r and all k sufficiently large, there exists a constant c = c® > 0 such that the k-colour Ramsey number of the r-cycle is at least (r-1)(2+c)k-1.

This is joint work with Robert Johnson.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity