Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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.
