Minimizing the number of independent sets in triangle-free regular graphs (Q1690246): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2017.11.016
@@ Property / DOI: 10.1016/j.disc.2017.11.016 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.05714
@@ Property / arXiv ID: 1610.05714 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3323698
@@ Property / cites work: Q3323698 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of complete subgraphs in a graph with given maximum degree
+Normal rank
@@ Property / cites work @@
+Independent sets, matchings, and occupancy fractions
+Normal rank
@@ Property / cites work @@
+On the average size of independent sets in triangle-free graphs
+Normal rank
@@ Property / cites work @@
+On weighted graph homomorphisms
@@ Property / cites work: On weighted graph homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+An Entropy Approach to the Hard-Core Model on Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A note on the independence number of triangle-free graphs. II
+Normal rank
@@ Property / cites work @@
+Some Ramsey-Type Numbers and the Independence Ratio
+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 @@
+Extremal Regular Graphs: Independent Sets and Graph Homomorphisms
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2017.11.016
@@ Property / DOI: 10.1016/J.DISC.2017.11.016 / rank @@
+Normal rank