Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 26, 2022, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Kalina Petrova

Size-Ramsey numbers of subcubic graphs

The size-Ramsey number of a graph H is the smallest number of edges a graph G can have such that for every two-coloring of its edges, there is a monochromatic copy of H in G. Recently, Conlon, Nenadov and Trujic showed that if H is a graph of maximum degree three on n vertices, then the size-Ramsey number of H is O(n^{8/5}). This bound is best possible if the host graph G is a vanilla binomial random graph. We break this barrier using a novel host graph construction. This is joint work with Nemanja Draganic.

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