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, February 03, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Sonny Ben-Shimon (Tel Aviv Univ.)

Local resilience of regular graphs

Given an increasing monotone graph property $\mathcal{P}$, the local resilience of a graph $G$ with respect to $\mathcal{P}$ is the minimum $r$ for which $G$ contains a subgraph $H$ of maximal degree $\Delta(H)=r$ such that $G-H$ does not posses $\mathcal{P}$. Although this notion had been previously studied implicitly for some graph properties and graph families, it was only recently that a systematic approach to the problem was initiated by Sudakov and Vu. The main focus of the original work of Sudakov and Vu and of subsequent works was in the resilience of random and pseudorandom graphs with respect to several graph properties. In this talk we continue to explore this notion of local resilience of graphs, where our graphs are random and pseudorandom regular graphs. Specifically, we explore the local resilience of regular graphs with respect to edge-connectivity, containing a perfect matching, and being Hamiltonian.

Joint work in progress with M. Krivelevich 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