Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.07646 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918281910157312 |
|---|---|
| author | Chandrakar, Himanshu Hazra, Nisith Ranjan Rout, Debotosh Singh, Anurag |
| author_facet | Chandrakar, Himanshu Hazra, Nisith Ranjan Rout, Debotosh Singh, Anurag |
| contents | Inspired by the work of Fr{ö}berg (1990) and Eagon and Reiner (1998), Bayer et al. recently introduced two new graph complexes: total cut complexes and cut complexes. In this article, we investigate these complexes specifically for (rectangular) grid graphs, focusing on $2 \times n$ and $3 \times n$ cases. We extend and refine the work of Bayer et al., proving and strengthening several of their conjectures, thereby enhancing the understanding of these graph complexes' topological and combinatorial properties. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_07646 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Topology of total cut complexes and cut complexes of grid graphs Chandrakar, Himanshu Hazra, Nisith Ranjan Rout, Debotosh Singh, Anurag Combinatorics Inspired by the work of Fr{ö}berg (1990) and Eagon and Reiner (1998), Bayer et al. recently introduced two new graph complexes: total cut complexes and cut complexes. In this article, we investigate these complexes specifically for (rectangular) grid graphs, focusing on $2 \times n$ and $3 \times n$ cases. We extend and refine the work of Bayer et al., proving and strengthening several of their conjectures, thereby enhancing the understanding of these graph complexes' topological and combinatorial properties. |
| title | Topology of total cut complexes and cut complexes of grid graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.07646 |