Title: Recent advances in hypergraph matchings and colorings

Speaker: 강동엽 박사 (Institute for Basic Science)

Abstract: Hypergraph matchings and colorings are fundamental objects in extremal and probabilistic combinatorics. In this talk, I would like to discuss recent results on hypergraph matchings and colorings, with a particular emphasis on a recent resolution of the Erdos-Faber-Lovasz conjecture.