The reviewed record of science sign in
Pith

arxiv: 1409.0277 · v2 · pith:QDX375P4 · submitted 2014-09-01 · math.AC · math.CO

Regularity of powers of forests and cycles

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:QDX375P4record.jsonopen to challenge →

classification math.AC math.CO
keywords regularitywhengraphhamiltonianlinearasymptoticattainsbounds
0
0 comments X
read the original 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 I^s for all s > 0. In particular, for these classes of graphs, we provide the asymptotic linear function reg(I^s) as s > 0, and the initial value of s starting from which reg(I^s) 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.