Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, April 16, 2024, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Simona Boyadzhiyska (University of Birmingham)
The Ramsey number of a pair of graphs (G,H), denoted by R(G,H), is the smallest integer n such that, for every red/blue-coloring of the edges of the complete graph Kn, there exists a red copy of G or a blue copy of H. In the 1980s, Burr showed that, if G is large and connected, then R(G,H) is bounded below by (v(G)-1)(χ(H)-1)+σ(H), where χ(H) is the chromatic number of H and σ(H) stands for the minimum size of a color class over all proper χ(H)-colorings of H. We say that G is H-good if R(G,H) is equal to this general lower bound. This notion was first studied systematically by Burr and Erdős and has received considerable attention from researchers since its introduction. Among other results, it was shown by Burr that, for any graph H, every sufficiently long path is H-good.
These concepts generalize in the natural way to k-graphs, and in this talk we will explore the notion of Ramsey goodness when G is an ℓ-path for some ℓ∈[k-1]. We will show that, while long loose paths are not always H-good, they are very close to being H-good for every k-graph H. As we will see, this is in stark contrast to the behavior of ℓ-paths for larger ℓ.
This is joint work with Allan Lo.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login