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

  Browse A-Z

Log in

Googledetails Microsoftdetails

πŸ” Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Multicolour Ramsey Numbers of Odd Cycles

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Room, Hills Road Sixth Form College, Cambridge, CB2 8PE Hybrid (In-Person + Online). Google Meet Link: https://meet.google.com/yeu-pqce-rsn MR 4

Other talks

Talk title TBC TBC How Far Can Good Go Without God? The Limits of a Naturalistic Ethic Morning Tea and Coffee Group Work Packing the Border: Quail Crates and the Regulation of Animal Movement on the US-Mexico Border, 1910s-1940s
 

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