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
Probability for Computer ScienceIndian Institute of Technology Kanpur via Swayam Exploration with Limited Memory - Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits
Association for Computing Machinery (ACM) via YouTube Probabilistic Methods for Increased Robustness in Machine Learning
Alan Turing Institute via YouTube Stochastic Weighted Matching - 1-Epsilon Approximation
IEEE via YouTube X-Ramanujan Graphs
Simons Institute via YouTube