-

Finite Hypergraph Families with Rich Extremal Turan Constructions via Mixing Patterns

组织者

本杰明·苏达科夫

演讲者

Oleg Pikhurko

时间

2023年02月28日 17:05 至 18:15

地点

Online

线上

Zoom 787 662 9899 (BIMSA)

摘要

Previously, it was shown by the speaker that for any $k$-graph pattern $P$ there is a finite forbidden family $F$ such that maximum recursive blow-ups of $P$ are precisely maximum $F$-free $k$-graphs. I will discuss joint work with Xizhi Liu where we extend this result by allowing to mix different patterns and present some applications to finding finite forbidden families with rich sets of (almost) extremal Turan constructions.

演讲者介绍

Oleg Pikhurko received his undergraduate degree from L'viv State University, Ukraine, in 1995 and his PhD from the University of Cambridge, UK, in 2000. He had a Junior Research Fellowship at St John's College, Cambridge (2000-2003) and a faculty position at Carnegie Mellon University (2003-2012). He is a professor at the University of Warwick, working there since 2011. He held an ERC Starting Grant 2012-8 and is currently supported by a Leverhulme Research Project Grant (since 2019) and an ERC Advanced Grant (since 2022). His research interests include extremal and probabilistic combinatorics, descriptive combinatorics and limits of discrete structures.