Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, March 26, 2019, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Charlotte Knierim
We study the multicolor Ramsey numbers for paths and even cycles, Rk(Pn) and Rk(Cn), which are the smallest integers N such that every coloring of the complete graph KN has a monochromatic copy of Pn or Cn respectively. For a long time, Rk(Pn) has only been known to lie between (k−1+o(1))n and (k+o(1))n. A recent breakthrough by Sárközy and later improvement by Davies, Jenssen and Roberts give an upper bound of (k−1/4+o(1))n. We improve the upper bound to (k−1/2+o(1))n. Our approach uses structural insights in connected graphs without a large matching. This is joint work with Pascal Su.
Automatic MiSe System Software Version 1.4803M | admin login