Friday, April 16, 2021

Friday, April 16, 2021 — 3:30 PM EDT

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

Speaker: Tom Kelly Affliliation: University of Birmingham Zoom: Contact Emma Watson

Abstract:

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$.  We prove this conjecture for every sufficiently large $n$.  This is joint work with Dong Yeap Kang, Daniela Kühn, Abhishek Methuku, and Deryk Osthus.

S M T W T F S
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
  1. 2022 (112)
    1. October (3)
    2. September (11)
    3. August (2)
    4. July (17)
    5. June (17)
    6. May (10)
    7. April (12)
    8. March (18)
    9. February (10)
    10. January (13)
  2. 2021 (103)
    1. December (3)
    2. November (7)
    3. October (6)
    4. September (12)
    5. August (6)
    6. July (10)
    7. June (12)
    8. May (7)
    9. April (9)
    10. March (13)
    11. February (8)
    12. January (10)
  3. 2020 (119)
  4. 2019 (167)
  5. 2018 (136)
  6. 2017 (103)
  7. 2016 (137)
  8. 2015 (136)
  9. 2014 (88)
  10. 2013 (48)
  11. 2012 (39)
  12. 2011 (36)
  13. 2010 (40)
  14. 2009 (40)
  15. 2008 (39)
  16. 2007 (15)