Optimal Graphs for Independence and k-Independence Polynomials

The independence polynomialI(G, x) of a finite graph G is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether, given a fixed number of vertices and edges, there exists optimally-least (optimally-greatest) graphs, that are least (respectively, greatest) for all non-negative x. Moreover, we broaden our scope to k-independence polynomials, which are generating functions for the k-clique-free subsets of vertices. For $$k \ge 3$$k≥3, the results can be quite different from the $$k = 2$$k=2 (i.e. independence) case.

[1]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[2]  Jason I. Brown,et al.  Nonexistence of optimal graphs for all terminal reliability , 2014, Networks.

[3]  Italo Simonelli,et al.  Optimal graphs for chromatic polynomials , 2008, Discret. Math..

[4]  R. Stanley.  The Upper Bound Conjecture and Cohen‐Macaulay Rings , 1975 .

[5]  Andrew H. Hoefel.  HILBERT FUNCTIONS IN MONOMIAL ALGEBRAS , 2011 .

[6]  Wendy Myrvold,et al.  Uniformly-most reliable networks do not always exist , 1991, Networks.

[7]  M. Simonovits,et al.  On the number of complete subgraphs of a graph II , 1983 .

[8]  Martin Aigner,et al.  Proofs from THE BOOK , 1998 .

[9]  Doron Zeilberger,et al.  The Number of [Old-Time] Basketball Games with Final Score n:n where the Home Team was Never Losing but also Never Ahead by More Than w Points , 2007, Electron. J. Comb..

[10]  Appajosyula Satyanarayana,et al.  Least reliable networks and the reliability domination , 1990, IEEE Trans. Commun..

[11]  F. S. Macaulay.  Some Properties of Enumeration in the Theory of Modular Systems , 1927 .

[12]  David C. Fisher,et al.  Dependence polynomials , 1990, Discret. Math..

[13]  Jonathan Cutler,et al.  Extremal Problems for Independent Set Enumeration , 2011, Electron. J. Comb..

[14]  Jason I. Brown,et al.  Independence polynomials of circulants with an application to music , 2009, Discret. Math..

[15]  G. Katona.  A theorem of finite sets , 2009 .

[16]  Xiaoming Li,et al.  On the existence of uniformly optimally reliable networks , 1991, Networks.

[17]  M. Aigner,et al.  Proofs from "The Book" , 2001 .

[18]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[19]  Daniel Gross,et al.  Uniformly optimally reliable graphs , 1998, Networks.

[20]  J. Jonsson.  Simplicial complexes of graphs , 2007 .

[21]  Takayuki Hibi,et al.  Componentwise linear ideals , 1999, Nagoya Mathematical Journal.

[22]  M. Sobel,et al.  SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS , 2000, Probability in the engineering and informational sciences (Print).

[23]  John T. Saccoman,et al.  Uniformly optimally reliable graphs , 1998 .

[24]  A. Satyanarayana,et al.  Graphs with least number of colorings , 1995, J. Graph Theory.