The graph minor theorem in topological combinatorics

Dane Miyata, Eric Ramos

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of [13]. We prove that these complexes must have universally bounded torsion in their homology across all graphs of bounded genus. One may think of these results as arising from an algebraic version of the graph minor theorem of Robertson and Seymour [19,20].

Original languageEnglish
Article number109203
JournalAdvances in Mathematics
Volume430
DOIs
StatePublished - 1 Oct 2023

Keywords

  • Graph minors
  • Matching complexes
  • Representation stability
  • Topological combinatorics

Fingerprint

Dive into the research topics of 'The graph minor theorem in topological combinatorics'. Together they form a unique fingerprint.

Cite this