![Loading Events](https://dimag.ibs.re.kr/cms/wp-content/plugins/the-events-calendar/src/resources/images/tribe-loading.gif)
- This event has passed.
Dong Yeap Kang (강동엽), A proof of the Erdős-Faber-Lovász conjecture
Wednesday, January 27, 2021 @ 10:00 AM - 11:00 AM KST
Zoom ID: 869 4632 6610 (ibsdimag)
A hypergraph is linear if every pair of two distinct edges shares at most one vertex. A longstanding conjecture by Erdős, Faber, and Lovász in 1972, states that the chromatic index of any linear hypergraph on
In this talk, I will present the ideas to prove the conjecture for all large