University of Cambridge > Talks.cam > Combinatorics Seminar > Cycle-complete Ramsey numbers

  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

Cycle-complete Ramsey numbers

Download to your calendar using vCal

  • UserPeter Keevash (University of Oxford)
  • ClockThursday 07 February 2019, 14:30-15:30
  • HouseMR12.

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

The cycle-complete Ramsey number f(k,n) is the smallest number N such that any red/blue edge-colouring of K_N contains a red C_k (k-cycle) or a blue K_n (complete graph on n vertices). In 1978, Erdos, Faudree, Rousseau and Schelp conjectured that f(k,n)=(k-1)(n-1)+1 if k>=n>=3 (except when k=n=3). I will describe a proof of this conjecture for large k. In fact, we show that f(k,n)=(k-1)(n-1)+1 whenever k is at least C log n / log log n, which is tight up to the value of the absolute constant C>0, and answers two further questions of Erdos et al. up to multiplicative constants. This is joint work with Eoin Long and Jozef Skokan.

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 2, IfM, Alan Reece Building, 17 Charles Babbage Road Riley Room 2S3, Donald McIntyre Building, Faculty of Education, 184 Hills Road, Cambridge CB2 8PQ

Other talks

Quantum optics with organic molecules "Gods, Monsters & Middle-class Uncles: Indian Comics in a Time between Worlds" The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck Security Cooperation within Government and between Governments Differences between Robin and Neumann eigenvalues CUSCRS and Renal Medicine
 

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