Ordered alternating paths and the depth of symbolic powers of cover ideals of graphs
arXiv:2607.04231
Abstract
Let be a simple graph with cover ideal in a polynomial ring in variables. For a matching of , we denote by the length of the longest -alternating path in . We define to be the maximum size of an ordered matching of such that . We then prove that for all , where denotes the -th symbolic power of , and that equality holds when is a forest.