The Topological Complexity of Pure Graph Braid Groups Is Stably Maximal

Explore a proof of Farber's conjecture on the topological complexity of configuration spaces of graphs in this 49-minute conference talk. Delve into an argument that avoids cohomology and instead focuses on group theoretic estimates for higher topological complexity, following the work of Farber–Oprea and Grant–Lupton–Oprea. Gain insights into pure graph braid groups and their stably maximal topological complexity as presented by Ben Knudsen at the Applied Algebraic Topology Network.