Limit method in extremal combinatorics
|
Tue, 26/02 14:30 |
Oleg Pikhurko (Warwick) |
Combinatorial Theory Seminar  |
L3 |
| Razborov's flag algebras provide a formal system for operating with asymptotic inequalities between subgraph densities, allowing to do extensive "book-keeping" by a computer. This novel use of computers led to progress on many old problems of extremal combinatorics. In some cases, finer structural information can be derived from a flag algebra proof by by using the Removal Lemma or graph limits. This talk will overview this approach. | |||