Matching Complexes of Outerplanar Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912109015597056 |
|---|---|
| author | Bayer, Margaret Milutinović, Marija Jelić Vega, Julianne |
| author_facet | Bayer, Margaret Milutinović, Marija Jelić Vega, Julianne |
| contents | An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres. This extends known results about trees and polygonal line tilings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_04601 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Matching Complexes of Outerplanar Graphs Bayer, Margaret Milutinović, Marija Jelić Vega, Julianne Combinatorics 05C70 (primary), 05C10, 05E45, 55U10 (secondary) An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres. This extends known results about trees and polygonal line tilings. |
| title | Matching Complexes of Outerplanar Graphs |
| topic | Combinatorics 05C70 (primary), 05C10, 05E45, 55U10 (secondary) |
| url | https://arxiv.org/abs/2411.04601 |