Maximizing H‐Colorings of a Regular Graph (Q4920651): Difference between revisions

@@ Property / arXiv ID @@
+.3758
@@ Property / arXiv ID: 1110.3758 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets in regular graphs and sum-free subsets of finite groups
+Normal rank
@@ Property / cites work @@
+Random Regular Graphs  of Non-Constant Degree:  Independence and Chromatic Number
+Normal rank
@@ Property / cites work @@
+Extremal graphs for homomorphisms
@@ Property / cites work: Extremal graphs for homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+The Multistate Hard Core Model on a Regular Tree
@@ Property / cites work: The Multistate Hard Core Model on a Regular Tree / rank @@
+Normal rank
@@ Property / cites work @@
+An Entropy Approach to the Hard-Core Model on Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Entropy, independent sets and antichains: A new approach to Dedekind’s problem
+Normal rank
@@ Property / cites work @@
+Maximizing the number of <i>q</i> -colorings
@@ Property / cites work: Maximizing the number of <i>q</i> -colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Information Inequalities for Joint Distributions, With Interpretations and Applications
+Normal rank
@@ Property / cites work @@
+Markov random field models of multicasting in tree networks
+Normal rank
@@ Property / cites work @@
+A note on the independence number of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+A logical expansion in mathematics
@@ Property / cites work: A logical expansion in mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+The Number of Independent Sets in a Regular Graph
@@ Property / cites work: The Number of Independent Sets in a Regular Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The Bipartite Swapping Trick on Graph Homomorphisms
+Normal rank

Maximizing <i>H</i>‐Colorings of a Regular Graph (Q4920651): Difference between revisions

Latest revision as of 11:24, 6 July 2024

Statements

Sitelinks

Mathematics(1 entry)