Title: F-factors in graphs with randomness conditions

Keynote Speaker: Han Jie

Abstract:

The celebrated Hajnal--Szemeredi Theorem is a cornerstone in extremal graph theory and has many applications and extensions. We will focus on a class of extensions where the host graph enjoys mild randomness conditions (e.g., does not have large independent set, or contains a small amount of random edges) and discuss some recent problems and developments.

Introduction to the Speaker:

Han Jie, mainly studying extremal graph theory, has published multiple SCI papers in Journal of Combinatorial Theory, Series B, Combinatorics, Probability, and Computing, SIAM Journal on Discrete Mathematics, Random Structures & Algorithms and other top journals in the field of combinatorics.

Inviter:

Wang Guanghui Professor in the School of Mathematics

Time:

10:00 on October 2 (Friday)

Location:

Lecture Hall 924, Block B, Zhixin Building, Central Campus

Sponsored by: School of Mathematics, Shandong University