English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Farber's conjecture for planar graphs

MPS-Authors
/persons/resource/persons267220

Knudsen,  Ben
Max Planck Institute for Mathematics, Max Planck Society;

External Resource
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

2010.13530.pdf
(Preprint), 200KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Knudsen, B. (2021). Farber's conjecture for planar graphs. Selecta Mathematica. New Series, 27(5): 90. doi:10.1007/s00029-021-00702-w.


Cite as: https://hdl.handle.net/21.11116/0000-0009-7944-3
Abstract
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.