BIMSA >
Research seminar in Discrete Mathematics
Multicolored Turan problem via multipartite graph sparsification
Multicolored Turan problem via multipartite graph sparsification
Organizer
Benjamin Sudakov
Speaker
Hong Liu
Time
Tuesday, April 29, 2025 5:05 PM - 6:15 PM
Venue
Online
Online
Zoom 787 662 9899
(BIMSA)
Abstract
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.
Speaker Intro
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.