Regularity of powers of forests and cycles
Abstract
Let G be a graph and let I = I(G) be its edge ideal. In this paper, when G is a forest or a cycle, we explicitly compute the regularity of Is for all s > 0. In particular, for these classes of graphs, we provide the asymptotic linear function reg(Is) as s > 0, and the initial value of s starting from which reg(Is) attains its linear form. We also give new bounds on the regularity of I when G contains a Hamiltonian path and when G is a Hamiltonian graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.