Algebraic study on permutation graphs
Commutative Algebra
2025-02-28 v1 Combinatorics
Abstract
Let be a permutation graph. We show that is Cohen-Macaulay if and only if is unmixed and vertex decomposable. When this is the case, we obtain a combinatorial description for the -invariant of . Moreover, we characterize the Gorenstein permutation graphs.
Cite
@article{arxiv.2502.19992,
title = {Algebraic study on permutation graphs},
author = {Antonino Ficarra and Somayeh Moradi},
journal= {arXiv preprint arXiv:2502.19992},
year = {2025}
}