Maximizing H‐Colorings of a Regular Graph
暂无分享,去创建一个
[1] H. Whitney. A logical expansion in mathematics , 1932 .
[2] O. Pikhurko,et al. Maximizing the number of q‐colorings , 2008, 0811.2625.
[3] Mokshay M. Madiman,et al. Information Inequalities for Joint Distributions, With Interpretations and Applications , 2008, IEEE Transactions on Information Theory.
[4] Prasad Tetali,et al. On Weighted Graph Homomorphisms , 2001, Graphs, Morphisms and Statistical Physics.
[5] Jeff Kahn,et al. An Entropy Approach to the Hard-Core Model on Bipartite Graphs , 2001, Combinatorics, Probability and Computing.
[6] Partha P. Mitra,et al. Markov random field models of multicasting in tree networks , 2002, Advances in Applied Probability.
[7] James B. Shearer,et al. A note on the independence number of triangle-free graphs , 1983, Discret. Math..
[8] Yufei Zhao,et al. The Bipartite Swapping Trick on Graph Homomorphisms , 2011, SIAM J. Discret. Math..
[9] Alan M. Frieze,et al. Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number , 2002, Combinatorics, Probability and Computing.
[10] N. Alon. Independent sets in regular graphs and sum-free subsets of finite groups , 1991 .
[11] Fabio Martinelli,et al. The Multistate Hard Core Model on a Regular Tree , 2011, SIAM J. Discret. Math..
[12] J. Kahn. Entropy, independent sets and antichains: A new approach to Dedekind's problem , 2001 .
[13] Jonathan Cutler,et al. Extremal graphs for homomorphisms , 2011, J. Graph Theory.