Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, March 09, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Daniel Kral (University of Warwick)

Graph limits and extremal combinatorics

The theory of graph limits aims at providing tools to analyze and model large graphs. In particular, the analytic models of large dense graphs are closely related to the flag algebra method, which has found many applications in extremal combinatorics. Motivated by problems from extremal graph theory, we will study the structure of dense graph limits that are uniquely determined by finitely many subgraph densities and disprove several conjectures posed by Lovasz and Szegedy on the structure of such graph limits.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login