Hamiltonicity in pseudorandom graphs: absorbing paths.

Abstract:  In this second talk, we will introduce the “extendability method” for embedding sparse structures in expander graphs and we will use it to construct efficient absorbers to solve the Hamiltonicity problem in pseudorandom graphs.

Date: Jun 11, 2024 at 14:00:00 h
Venue: Sala de Seminario John Von Neumann, CMM, Beauchef 851, Torre Norte, Piso 7.
Speaker: Matías Pavez
Affiliation: Centro de Modelamiento Matemático, Universidad de Chile
Coordinator: Matías Pavez
More info at:
Event website
Abstract:
PDF

Posted on Jun 10, 2024 in Seminario de Grafos, Seminars