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.