We study the monomial algebra k[G], associated to a graph G. In particular, in the case of the simple complete graph, the intersection degree id(k[G]) of two principal ideals of k[G] is investigated, proving that id(k[G]) is less or equal than 2m + n, where m and n are the degrees of the monomials generators of the principal ideals.
Combinatorics of the complete graph
Cisto C.;Failla G.
2020-01-01
Abstract
We study the monomial algebra k[G], associated to a graph G. In particular, in the case of the simple complete graph, the intersection degree id(k[G]) of two principal ideals of k[G] is investigated, proving that id(k[G]) is less or equal than 2m + n, where m and n are the degrees of the monomials generators of the principal ideals.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
