2 problems

Let $G$ be an enumerated graph. Let $\ell$ be the length of the longest induced path in $G$, and let $\ell_{<}$ be the length of the longest admissible path in $G$. Write…

Let $N$ be the net graph. Its binomial edge ideal is denoted by $J_N$, and write $\widehat{\operatorname{reg}}(J_N)$ for its asymptotic regularity. Net graph asymptotic regularity…