Proofs

I will prove here the main theorems of the first talk, using two approaches: the first one is global while the second one, that does not give the optimal bounds of the first one, is locally topological. The interest of this second approach, based on induction on the genus, is that it introduces tools that are essential to produce optimal examples of graphs with a complete leftward walk.

You can learn more about Professor Lalonde here.