YoVDO

Hamiltonicity of Expanders: Optimal Bounds and Applications

Offered By: BIMSA via YouTube

Tags

Graph Theory Courses Combinatorics Courses Theoretical Computer Science Courses Expander Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Analytic Combinatorics, Part I
Princeton University via Coursera Analytic Combinatorics, Part II
Princeton University via Coursera Analytic Combinatorics
Princeton University via Coursera Principles of Computing (Part 1)
Rice University via Coursera Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera