Skip to content

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Structural properties of admissible subgraphs and the depth of symbolic powers of cover ideals

Let $G$ be a simple graph with cover ideal $J(G)$ in a polynomial ring $S = \k[x_1, \ldots, x_n]$. For each integer $t \ge 1$, let $\alpha_t(G)$ denote the maximum size of an ordered matching $M$ of $G$ with alternating path length $\ell(M) \le 2t - 1$. Hang, Tam, and Vu established that \[ \operatorname{depth}\!\left(...

H. Nguyen, T. Nguyễn, Thanh Vu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.