Maximizing the Number of Independent Sets of a Fixed Size (Q5364240): Difference between revisions

@@ Property / author @@
-Benjamin Sudakov
@@ Property / author: Benjamin Sudakov / rank @@
-Normal rank
@@ Property / author @@
+Benjamin Sudakov
@@ Property / author: Benjamin Sudakov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4147
@@ Property / arXiv ID: 1311.4147 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets in graphs with given minimum degree
+Normal rank
@@ Property / cites work @@
+A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs
+Normal rank
@@ Property / cites work @@
+The maximum number of complete subgraphs in a graph with given maximum degree
+Normal rank
@@ Property / cites work @@
+Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree
+Normal rank
@@ Property / cites work @@
+Two problems on independent sets in graphs
@@ Property / cites work: Two problems on independent sets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Entropy Approach to the Hard-Core Model on Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4071752
@@ Property / cites work: Q4071752 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5726070
@@ Property / cites work: Q5726070 / rank @@
+Normal rank
@@ Property / cites work @@
+On Independent Sets in Graphs with Given Minimum Degree
+Normal rank
@@ Property / cites work @@
+Q5294699
@@ Property / cites work: Q5294699 / rank @@
+Normal rank
@@ Property / cites work @@
+On Chromatic Graphs
@@ Property / cites work: On Chromatic Graphs / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3105673126
@@ Property / OpenAlex ID: W3105673126 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5364240