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.
Comparte en: