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, October 24, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Roman Glebov

Finitely forcible graphons

In extremal graph theory, we often consider large graphs that are in the limit uniquely determined by finitely many densities of their subgraphs. The corresponding limits (so-called graphons) are called finitely forcible. Motivated by classical results in extremal combinatorics as well as by recent developments in the study of finitely forcible graphons, Lovasz and Szegedy made some conjectures about the structure of such graphons. In particular, they conjectured that the topological space of typical points of every finitely forcible graphon is compact and finitely dimensional. In this talk we give a brief overview about the corresponding results, and in particular show that these two conjectures are false.

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