Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of tactical configurations, focusing on Rödl Nibble. It discusses the minimal size of subsets needed to cover every element set, exploring the properties of K-sets and base points. The lecture delves into the covering and packing numbers, providing insights into the existence and construction of tactical configurations in combinatorics.