A Proof of the Erdos-Faber-Lovasz Conjecture
Offered By: BIMSA via YouTube
Course Description
Overview
Explore a groundbreaking proof of the Erdős-Faber-Lovász conjecture in this 46-minute conference talk by Dong Yeap Kang at BIMSA. Delve into the intricacies of the conjecture, which states that the chromatic index of any linear hypergraph on n vertices with maximum degree at most n is at most n. Discover the recent proof and its generalization for every large n, presented by Kang and his collaborators Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus. Gain insights into this significant advancement in graph theory and combinatorics, resolving a problem that has remained open since 1972.
Syllabus
Dong Yeap Kang: A proof of the Erdos-Faber-Lovasz conjecture #ICBS2024
Taught by
BIMSA
Related Courses
Introduction to High Dimensional Expanders - Irit DinurInstitute for Advanced Study via YouTube The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
IEEE via YouTube Graph Representation Learning and Its Applications to Biomedicine
Applied Algebraic Topology Network via YouTube Asaf Shapira - Local vs Global Combinatorics
International Mathematical Union via YouTube Tropical Solutions to Hard Problems in Auction Theory and Neural Networks - Lecture II
Hausdorff Center for Mathematics via YouTube