-

Multicolored Turan problem via multipartite graph sparsification

组织者

本杰明·苏达科夫

演讲者

Hong Liu

时间

2025年04月29日 17:05 至 18:15

地点

Online

线上

Zoom 787 662 9899 (BIMSA)

摘要

Abstract: We prove a version of sparsification result for multipartite graphs which finds, within any multipartite graph with positive pairwise densities, a bounded order subgraph with sufficiently many parts and almost the same pairwise densities. As an application, we address a multicolor Turan problem first suggested by Bollobas. This is joint work with Ander Lamaison.

演讲者介绍

Hong Liu is the head of the Extremal Combinatorics and Probability Group (ECOPRO) and a distinguished research fellow at the Institute for Basic Science (IBS). Previously, he was a faculty at the Mathematics Institute at University of Warwick. He was awarded the UK Research and Innovation Future Leaders Fellowship in 2019. Before that, he was a Leverhulme Early Career Fellow, working with Oleg Pikhurko. Hong got his Ph.D. in 2015 at University of Illinois at Urbana Champaign, advised by József Balogh. His primary research interests are extremal and probabilistic combinatorics.