JieHan Archives - Discrete Mathematics Group

February 27, 2024July 6, 2024

Jie Han gave a talk on the complexity of deciding the existence of a perfect matching in k-uniform hypergraphs under various degree conditions at the Discrete Math Seminar

On February 27, 2024, Jie Han (韩杰) from the Beijing Institute of Technology gave a talk at the Discrete Math Seminar on the complexity of deciding the existence of a perfect matching in k-uniform hypergraphs under various degree conditions. The title of his talk was “Perfect matchings in dense uniform hypergraphs“. Jie Han will stay at IBS for two months.

Jie Han (韩杰), Perfect matchings in dense uniform hypergraphs

There has been a raising interest on the study of perfect matchings in uniform hypergraphs in the past two decades, including extremal problems and their algorithmic versions. I will introduce the problems and some recent developments.

Jie Han, Spanning trees in expanders

We consider the spanning tree embedding problem in dense graphs without bipartite holes and sparse graphs. In 2005, Alon, Krivelevich and Sudakov asked for determining the best possible spectral gap forcing an $(n,d,\lambda)$-graph to be $T(n, \Delta)$-universal. In this talk, we introduce our recent work on this conjecture.

Tag: JieHan

Jie Han gave a talk on the complexity of deciding the existence of a perfect matching in k-uniform hypergraphs under various degree conditions at the Discrete Math Seminar

Jie Han (韩杰), Perfect matchings in dense uniform hypergraphs

Jie Han, Spanning trees in expanders

Niloufar Fuladi

Noleen Köhler

Joonkyung Lee (이준경)