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, March 22, 2022, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Nemanja Draganic

Induced subgraphs of sparse random graphs

In this talk we present several results about induced subgraphs of sparse random graphs G~G(n,p). For example, in all interesting regimes for p, we show that whp we can find induced matchings, certain forests, and paths of largest possible size. Furthermore, we consider monochromatic induced subgraphs of a colored G~G(n,p), and we get an improved bound for induced size-Ramsey numbers of paths. We finish with some open problems. The presented results are obtained in joint work with several subsets (allowing repetition) of the following group of people: O. Cooley, S. Glock, M. Kang, M. Krivelevich, R. Nenadov and B. Sudakov

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