Hypergraph Decompositions and Their Applications
Offered By: BIMSA via YouTube
Course Description
Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore hypergraph decompositions and their applications in this lecture by Professor Peter Keevash from the University of Oxford. Delve into the world of Combinatorics as Keevash, renowned for solving the Existence Conjecture for Combinatorial Designs, shares his expertise. Learn about the mathematical concepts behind hypergraph decompositions and discover their practical applications in various fields. Gain insights from a distinguished mathematician who has received accolades such as the European Prize in Combinatorics and the Whitehead Prize, and has spoken at the International Congress of Mathematicians.
Syllabus
Peter Keevash: Hypergraph decompositions and their applications
Taught by
BIMSA
Related Courses
Analytic CombinatoricsPrinceton University via Coursera Contest Math I
Brilliant Discrete Mathematics
City College of San Francisco via California Community Colleges System Liberal Arts Math
City College of San Francisco via California Community Colleges System Discrete Structures
Chaffey College via California Community Colleges System