Extremal combinatorics and asymptotic enumeration

点击翻译按钮获取中文摘要

Combinatorics is a branch of mathematics studying finite structures. The generality of these questions suggests wide applicability of combinatorics in other areas of pure mathematics (most notably in algebra, number theory, probability, and topology), as well as in real-world applications (discrete optimization, computer science).One of the oldest and most central parts of combinatorics are graph theory and enumerative combinatorics. Graph theory models networks (such as road connections, or internet users), and enumerative combinatorics concerns studying counting questions of various kinds.Extremal graph theory is a broad part of graph theory which investigates interplay between various graph parameters. One of the main tools in Extremal graph theory is the so-called Szemeredi Regularity Lemma. This tool (developed in the 70's) has become one of the corner-stones of modern mathematics. Recently, using the insights gained from the Regularity Lemma, Lovasz and Szegedy initiated study of graph limits.The proposed research project addresses major open questions in extremal graph theory and aims contribute to general theories the Regularity Lemma, graph limits, and by developing novel tools which will be used in enumerative combinatorics.