- Full text PDF available (3)
- This year (0)
- Last 5 years (0)
- Last 10 years (2)
Journals and Conferences
For a graph G, we show a theorem that establishes a correspondence between the fine Hilbert series of the Stanley-Reisner ring of the clique complex for the complementary graph of G and the fine subgraph polynomial of G. We obtain from this theorem some corollaries regarding the independent set complex and the matching complex.
The well known correspondence between even cycles of an undirected graph and polynomials in a binomial ideal associated to a graph is extended to odd cycles and polynomials in another binomial ideal. Other binomial ideals associated to an undirected graph are also introduced. The results about them with topics on monomial ideals are used in order to show… (More)
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph D in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic reasoning on cycles and directed cycles of graphs.