Multicolour Ramsey Numbers of Odd Cycles
Add to your list(s)
Download to your calendar using vCal
 Nick Day (QMUL)
 Thursday 16 June 2016, 14:3015:30
 MR12.
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 kcolouring of the complete graph of order 2^{k+ 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 kcolour 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 kcolour Ramsey number of the rcycle is at least (r1)(2+c)^{k1}.
This is joint work with Robert Johnson.
This talk is part of the Combinatorics Seminar series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
