Hankel edge ideals of trees and (semi-)Hamiltonian graphs (Q2082400)

Let \(\mathbb{K}\) be a field and \(G\) be a finite simple graph, that is a graph with a finite number of vertices, with no loops and no multiple edges. Associated to \(G\) one may associate the binomial edge ideal \(J_G\) (which was introduced by \textit{J. Herzog} et al. [Adv. Appl. Math. 45, No. 3, 317--333 (2010; Zbl 1196.13018)] and \textit{M. Ohtani} [Commun. Algebra 39, No. 3, 905--917 (2011; Zbl 1225.13028)]) and the Hankel edge ideal \(I_G\) (which was introduced only in [\textit{F. Chaudhry} et al., Bull. Iran. Math. Soc. 41, No. 4, 971--979 (2015; Zbl 1373.13021)]). In the article, the latter ideals are investigated. In particular, the minimal prime ideals of the Hankel edge ideal of labeled Hamiltonian and semi-Hamiltonian graphs are determined, and their radicality is also investigated. The Hankel edge ideal of trees with a natural labeling is also considered and trees whose Hankel edge ideal is a complete intersection are also characterised.