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 conjectureAdd to your list(s) Download to your calendar using vCal - Abhishek Methuku (Birmingham)
- Thursday 18 March 2021, 16:00-17:00
- https://bham-ac-uk.zoom.us/j/86238837160.
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. ## This talk is included in these lists:- https://bham-ac-uk.zoom.us/j/86238837160
- Combinatorics and Probability Seminar
- School of Mathematics Events
Note that ex-directory lists are not shown. |
## Other listsFeatured lists Geometry and Mathematical Physics seminar Type the title of a new list here## Other talksSeminar: TBA Colloquium: TBA Modelling uncertainty in image analysis. Well Founded Coalgebras Seminar: TBA Seminar: TBA |