TY - JOUR
T1 - The graph minor theorem in topological combinatorics
AU - Miyata, Dane
AU - Ramos, Eric
N1 - Publisher Copyright:
© 2023 Elsevier Inc.
PY - 2023/10/1
Y1 - 2023/10/1
N2 - 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].
AB - 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].
KW - Graph minors
KW - Matching complexes
KW - Representation stability
KW - Topological combinatorics
UR - http://www.scopus.com/inward/record.url?scp=85164427292&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85164427292&partnerID=8YFLogxK
U2 - 10.1016/j.aim.2023.109203
DO - 10.1016/j.aim.2023.109203
M3 - Article
AN - SCOPUS:85164427292
SN - 0001-8708
VL - 430
JO - Advances in Mathematics
JF - Advances in Mathematics
M1 - 109203
ER -