Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree
暂无分享,去创建一个
[1] Jonathan Cutler,et al. Extremal Problems for Independent Set Enumeration , 2011, Electron. J. Comb..
[2] N. Alon. Independent sets in regular graphs and sum-free subsets of finite groups , 1991 .
[3] Helmut Prodinger,et al. Fibonacci Numbers of Graphs: II , 1983, The Fibonacci Quarterly.
[4] R. Merrifield,et al. Topological methods in chemistry , 1989 .
[5] Jonathan Cutler,et al. The maximum number of complete subgraphs in a graph with given maximum degree , 2014, J. Comb. Theory, Ser. B.
[6] Colin McDiarmid,et al. On Independent Sets in Graphs with Given Minimum Degree , 2013, Comb. Probab. Comput..
[7] Hongbo Hua. A sharp upper bound for the number of stable sets in graphs with given number of cut edges , 2009, Appl. Math. Lett..
[8] Prasad Tetali,et al. Matchings and independent sets of a fixed size in regular graphs , 2009, J. Comb. Theory, Ser. A.
[9] Anders Sune Pedersen,et al. BOUNDS ON THE NUMBER OF VERTEX INDEPENDENT SETS IN A GRAPH , 2006 .
[10] Jeff Kahn,et al. An Entropy Approach to the Hard-Core Model on Bipartite Graphs , 2001, Combinatorics, Probability and Computing.
[11] J. R.,et al. Chemistry , 1929, Nature.
[12] Jonathan Cutler,et al. Extremal graphs for homomorphisms , 2011, J. Graph Theory.
[13] A A Sapozhenko. On the Number of Independent Sets in Bipartite Graphs with , 2000 .
[14] David Galvin. Two problems on independent sets in graphs , 2011, Discret. Math..
[15] Jonathan Cutler,et al. Independent Sets in Graphs with Given Minimum Degree , 2012, Electron. J. Comb..