Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Infinite dimensional finitely forcible graphon
Speaker:Tereza Klimosova
coming from:University of Warwick
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 3 March 2015
Duration:30 Minutes
Building:E1 4
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.
Name(s):Christina Fries
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
Christina Fries/AG1/MPII/DE, 02/10/2015 10:44 AM
Last modified:
Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Christina Fries, 02/18/2015 10:29 AM
  • Christina Fries, 02/10/2015 10:47 AM -- Created document.