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: Thursday, September 28, 2023, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Yanheng Wang

Continuity of Exact Perfect Matchings

Given a graph whose edges are either red or blue, a perfect matching is dubbed a k-PM if it contains exactly k reds. Generally the existence of 3-PM and 7-PM, say, tells us nothing about the existence of k-PM for k=4,5,6. In fact the feasibility regime can be as fractured as you want, hence "discontinuous". This talk goes in the other direction: We investigate for which graphs, and to what extent, does the feasibility of k-PM exhibit continuity. Several such graphs were known previously, for example graphs of small independence number [El Maalouly and Steiner 2022] and doubly chordal graphs [Haslebacher 2023]. I will summarise them under the "sandwich paradigm" which already appeared in former works. Then we apply the paradigm on some other graphs, notably those of small modular width. I will also sketch some "lifting theorems" saying that certain graphs can be "blown up" without breaking continuity. The talk is based on my thesis supervised by Bernd Gärtner and Nicolas El Maalouly.

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