Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 24, 2013, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Roman Glebov
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.
Automatic MiSe System Software Version 1.4803M | admin login