Infinite dimensional finitely forcible graphon
Graphs, Hypergraphs, and Computing
01 April 14:00 - 15:00
Tereza Klimosova - University of Warwick
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 Daniel Kral.
Magnus M. Halldorsson
Adam Mickiewicz University
Technical University of Denmark, DTU