Robertson’s conjecture and universal finite generation in the homology of graph braid groups

Ben Knudsen, Eric Ramos

Research output: Contribution to journalArticlepeer-review

Abstract

We formulate a categorification of Robertson’s conjecture analogous to the categorical graph minor conjecture of Miyata–Proudfoot–Ramos. We show that these conjectures imply the existence of a finite list of atomic graphs generating the homology of configuration spaces of graphs—in fixed degree, with a fixed number of particles, under topological embeddings. We explain how the simplest case of our conjecture follows from work of Barter and Proudfoot–Ramos, implying that the category of cographs is Noetherian, a result of potential independent interest.

Original languageEnglish
Article number82
JournalSelecta Mathematica, New Series
Volume30
Issue number5
DOIs
StatePublished - Nov 2024

Keywords

  • 05C10
  • 05C75
  • 18A25
  • 55R80

Fingerprint

Dive into the research topics of 'Robertson’s conjecture and universal finite generation in the homology of graph braid groups'. Together they form a unique fingerprint.

Cite this