Cohen-Macaulay permutation graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912106447634432 |
|---|---|
| author | Cheri, P. V. Dey, Deblina K, Akhil Kotal, Nirmal Veer, Dharm |
| author_facet | Cheri, P. V. Dey, Deblina K, Akhil Kotal, Nirmal Veer, Dharm |
| contents | In this article, we characterize Cohen-Macaulay permutation graphs. In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into $r$ disjoint maximal cliques, where $r$ is the cardinality of a maximal independent set of the graph. We also provide some sufficient conditions for a comparability graph to be a uniquely partially orderable (UPO) graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_17343 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Cohen-Macaulay permutation graphs Cheri, P. V. Dey, Deblina K, Akhil Kotal, Nirmal Veer, Dharm Commutative Algebra Combinatorics 05E40, 13F55, 13C14, 05C69, 06A07 In this article, we characterize Cohen-Macaulay permutation graphs. In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into $r$ disjoint maximal cliques, where $r$ is the cardinality of a maximal independent set of the graph. We also provide some sufficient conditions for a comparability graph to be a uniquely partially orderable (UPO) graph. |
| title | Cohen-Macaulay permutation graphs |
| topic | Commutative Algebra Combinatorics 05E40, 13F55, 13C14, 05C69, 06A07 |
| url | https://arxiv.org/abs/2310.17343 |