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
理论计算机科学基础 | Introduction to Theoretical Computer SciencePeking University via edX Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax 离散数学概论 Discrete Mathematics Generality
Peking University via Coursera Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam Discrete Mathematics
Shanghai Jiao Tong University via Coursera