|Title: Graph limit approach in extremal combinatorics|
|Speaker: Jan Volec of University of Hamburg and Emory University|
|Contact: Dwight Duffus, email@example.com|
|Date: 2019-02-18 at 4:00PM|
|Venue: MSC W301|
Over the last decade, different theories of combinatorial limits have emerged, and attracted substantial attention. In the first part of my talk, I will present the main ideas behind these techniques and describe their applications to problems in extremal combinatorics. Next, as a particular example of the techniques, I will focus on a conjecture of Kelly, Kuhn and Osthus on the degree thresholds of oriented cycles.
See All Seminars