Hamiltonicity of Expanders: Optimal Bounds and Applications
Offered By: BIMSA via YouTube
Course Description
Overview
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.
Syllabus
Nemanja Draganić: Hamiltonicity of expanders: optimal bounds and applications
Taught by
BIMSA
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer