Farber's conjecture for planar graphs

DOI10.1007/s00029-021-00702-wzbMath1478.55002arXiv2010.13530OpenAlexW3200843413WikidataQ113906289 ScholiaQ113906289MaRDI QIDQ2238222

Ben Knudsen

Publication date: 1 November 2021

Published in: Selecta Mathematica. New Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.13530

zbMATH Keywords

braid groupsconfiguration spacesgraphstopological complexity

Mathematics Subject Classification ID

Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Braid groups; Artin groups (20F36) Discriminantal varieties and configuration spaces in algebraic topology (55R80)

Related Items (1)

The topological complexity of pure graph braid groups is stably maximal

Cites Work

• Unnamed Item
• Higher topological complexity and its symmetrization
• Topological complexity of motion planning
• The homology of configuration spaces of trees with loops
• Characteristics of graph braid groups
• Topological complexity of unordered configuration spaces of certain graphs
• On higher analogs of topological complexity
• Subdivisional spaces and graph braid groups
• Topological complexity of configuration spaces of fully articulated graphs and banana graphs
• Estimates for homological dimension of configuration spaces of graphs
• Topological complexity of collision-free motion planning on surfaces
• Topological complexity of configuration spaces
• CONFIGURATION SPACES AND ROBOT MOTION PLANNING ALGORITHMS

This page was built for publication: Farber's conjecture for planar graphs