On Hamilton cycles in graphs defined by intersecting set systems

In 1970 Lov\'asz conjectured that every connected vertex-transitive graph admits a Hamilton cycle, apart from five exceptional graphs. This conjecture has recently been settled for graphs defined by intersecting set systems, which feature prominently throughout combinatorics. In this expository article, we retrace these developments and give an overview of the many different ingredients in the proofs.