Explore the fascinating world of graph and hypergraph packing in this 44-minute lecture by Julia Boettcher for the International Mathematical Union. Delve into key concepts such as Latin squares, orthogonal Latin squares, and hypergraph packing, examining their existence and applications. Learn about the role of randomness and absorbing techniques in solving packing problems. Discover real-world examples, including Cookman's Google and families of trees, and gain insights into proof strategies used in this field of mathematics.
Overview
Syllabus
Introduction
Overview
Latin Square
Orthogonal Latin Square
Graph and hypergraph packing
Latin squares
Hypergraph packing
When do they exist
Randomness
Absorbing
Examples
Cookmans Google
Family of trees
Proof
Proof strategy
Conclusion
Taught by
International Mathematical Union
