![Loading Events](https://dimag.ibs.re.kr/cms/wp-content/plugins/the-events-calendar/src/resources/images/tribe-loading.gif)
- This event has passed.
Jie Han (韩杰), Perfect matchings in dense uniform hypergraphs
February 27 Tuesday @ 4:30 PM - 5:30 PM KST
Room B332,
IBS (기초과학연구원)
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.