Pure Maths Colloquium - Analytic representations of large discrete structures - Prof Daniel Kráľ (Brno) Seminar

Event details

Abstract: The theory of combinatorial limits aims to provide analytic models representing large graphs and other discrete structures. Such analytic models have found applications in various areas of computer science and mathematics, for example, in relation to the study of large networks in computer science. We will provide a brief introduction to this rapidly developing area of combinatorics and we will then focus on several questions motivated by problems from extremal combinatorics. In particular, we will disprove a conjecture of Lovasz, which was one of the two most cited conjectures in the area and which informally says that optimal solutions to extremal graph theory problems can be made asymptotically unique by introducing finitely many additional constraints.