Hypergraph Decompositions and Their Applications
Offered By: BIMSA via YouTube
Course Description
Overview
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 Combinatorics, Part IPrinceton University via Coursera Analytic Combinatorics, Part II
Princeton University via Coursera Analytic Combinatorics
Princeton University via Coursera Principles of Computing (Part 1)
Rice University via Coursera Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera