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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Wednesday, May 22, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Marc Noy (Universitat Politècnica de Catalunya)

Zero-one laws for minor-closed classes of graphs

Let G be a minor-closed class of graphs all whose forbidden minors are 2-connected. We prove a zero-one law in monadic second-order logic for random connected graphs in G, and a convergence law for all graphs in G. For each surface S, we prove a zero-one law in first order logic for random connected graphs embeddable in S, and a convergence law for all graphs embeddable in S.

The proofs are based on several properties that hold for almost all graphs in a minor-closed class.

(Joint work with Peter Heinig, Tobias Müller and Anusch Taraz).


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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