Farber’s conjecture for planar graphs

• Ben Knudsen ^[1]
  1. [1] Northeastern University

     Northeastern University

     City of Boston, Estados Unidos

     
• Localización: Selecta Mathematica, New Series, ISSN 1022-1824, Vol. 27, Nº. 5, 2021
• Idioma: inglés
• DOI: 10.1007/s00029-021-00702-w
• Enlaces
  • Texto completo
• Resumen

  • We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher topological complexities. We include some discussion of the non-planar case, demonstrating that the standard approach to the conjecture fails at a fundamental level.