Abstract. 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 ...

PDF | 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.

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 ...

Volume： 21 Issue： 4 Page： 401-405 Publication year： 2005. JST Material Number： X0108A ISSN： 0911-0119 CODEN： GRCOE5 Document type： Article

The Hilbert Series of the Clique Complex. 405. Corollary 1. Let G be a graph on n vertices and let %( ¯G) be the clique complex of the complementary graph and ...

2005/12/01 · Matroid representation of clique complexes. In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem ...

It is shown that the Hilbert series of the face ring of a clique complex of a graph G is, up to a factor, just a specialization of , the subgraph polynomial ...

Stockholms universitet, Naturvetenskapliga fakulteten, Matematiska institutionen. Ferrarello, Daniela. 2005 (Engelska)Ingår i: Graphs and combinatorics ...

1999/09/09 · It is shown that the Hilbert series of the face ring of a clique complex (equiva- lently, flag complex) of a graph G is, up to a factor ...

2022/11/15 · Find a way to relate the Hilbert series of the clique complex and/or the subgraph polynomial to the statistics of hierarchical models. There ...