{"title":"A degree theorem for the simplicial closure of Auter Space","authors":"Juliet Aygun, Jeremy Miller","doi":"10.4310/hha.2024.v26.n1.a13","DOIUrl":null,"url":null,"abstract":"The degree of a based graph is the number of essential non-basepoint vertices after generic perturbation. Hatcher–Vogtmann’s degree theorem states that the subcomplex of Auter Space of graphs of degree at most $d$ is $(d-1)$-connected. We extend the definition of degree to the simplicial closure of Auter Space and prove a version of Hatcher–Vogtmann’s result in this context.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4310/hha.2024.v26.n1.a13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The degree of a based graph is the number of essential non-basepoint vertices after generic perturbation. Hatcher–Vogtmann’s degree theorem states that the subcomplex of Auter Space of graphs of degree at most $d$ is $(d-1)$-connected. We extend the definition of degree to the simplicial closure of Auter Space and prove a version of Hatcher–Vogtmann’s result in this context.