Hypergraph list coloring and Euclidean Ramsey theory (Q3094608): Difference between revisions

@@ Property / cites work @@
+Q4500691
@@ Property / cites work: Q4500691 / rank @@
+Normal rank
@@ Property / cites work @@
+The choice number of random bipartite graphs
@@ Property / cites work: The choice number of random bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New approximation guarantee for chromatic number
@@ Property / cites work: New approximation guarantee for chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Conditional Hardness for Approximate Coloring
@@ Property / cites work: Conditional Hardness for Approximate Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Euclidean Ramsey theorems. I
@@ Property / cites work: Euclidean Ramsey theorems. I / rank @@
+Normal rank
@@ Property / cites work @@
+On the Hardness of 4-Coloring a 3-Colorable Graph
@@ Property / cites work: On the Hardness of 4-Coloring a 3-Colorable Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On list coloring Steiner triple systems
@@ Property / cites work: On list coloring Steiner triple systems / rank @@
+Normal rank
@@ Property / cites work @@
+List coloring hypergraphs
@@ Property / cites work: List coloring hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873220
@@ Property / cites work: Q4873220 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating the chromatic number
+Normal rank
@@ Property / cites work @@
+Hypergraph extension of the Alon-Tarsi list coloring theorem
+Normal rank