Abstract
We prove that the category of directed graphs and graph maps carries a cofibration category structure in which the weak equivalences are the graph maps inducing isomorphisms on path homology.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 475-514 |
| Number of pages | 40 |
| Journal | Algebraic Combinatorics |
| Volume | 7 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2024 |
Bibliographical note
Publisher Copyright:© The author(s), 2024.
Keywords
- category
- cofibration
- cofibration category
- directed graph
- path homology
Fingerprint
Dive into the research topics of 'Cofibration category of digraphs for path homology'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS