Resumen de How to build a pillar: a proof of Thomassen’s conjecture
Carsten Thomassen in 1989 conjectured that if a graph has minimum degree more thanthe number of atoms in the universe (δ(G) ≥ 101010 ), then it contains a pillar, which isa graph that consists of two vertex-disjoint cycles of the same length, s say, along with svertex-disjoint paths of the same length which connect matching vertices in order around thecycles. Despite the simplicity of the structure of pillars and various developments of powerfulembedding methods for paths and cycles in the past three decades, this innocent lookingconjecture has seen no progress to date. We give a proof of this conjecture by building apillar (algorithmically) in sublinear expanders.
