Clique vectors of k-connected chordal graphs

The clique vector c(G) of a graph G is the sequence (c1,c2,…,cd) in Nd, where ci is the number of cliques in G with i vertices and d is the largest cardinality of a clique in G. In this note, we use tools from commutative algebra to characterize all possible clique vectors of k-connected chordal graphs.