Campus Event Calendar
Event Entry
What and Who
Infinite dimensional finitely forcible graphon
Tereza Klimosova
University of Warwick
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 3 March 2015
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are referred to as finitely forcible. We show that there exists a finitely forcible graphon such that the topological space of its typical vertices has infinite Lebesgue covering dimension, disproving the conjecture by Lovasz and Szegedy. The talk is based on joint work with Roman Glebov and Dan Kral.
Contact
Christina Fries
--email hidden
passcode not visible
logged in users only
Christina Fries, 02/18/2015 10:29
Christina Fries, 02/10/2015 10:47 -- Created document.
Christina Fries, 02/10/2015 10:47 -- Created document.