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 girth in graphs, the existence of graphs with a certain girth and independence number, and the probability of edges appearing independently. It also discusses the union bound, finding sets, and the recoloring of hypergraphs.