Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Explore a comprehensive lecture on the Hamiltonicity of expanders, focusing on optimal bounds and their applications. Delve into the research presented by Nemanja Draganić, a SNSF postdoctoral fellowship holder at the University of Oxford. Gain insights into extremal and probabilistic combinatorics, Ramsey theory, and theoretical computer science as Draganić shares his expertise acquired during his PhD at ETH Zurich under Benny Sudakov's supervision. Discover the latest developments in this field and understand the significance of optimal bounds in expanding graphs and their practical implications.
