University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > A proof of the Erdős–Faber–Lovász conjecture

A proof of the Erdős–Faber–Lovász conjecture

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact M.Jenssen.

The Erdős–Faber–Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on n vertices is at most n. In this talk, I will sketch a proof of this conjecture for every large n.

Joint work with Dongyeap Kang, Tom Kelly, Daniela Kuhn and Deryk Osthus.

This talk is part of the Combinatorics and Probability Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.