On the Problem of Erdős and Hajnal in the Case of List Colorings (Q2851493): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2009.07.064
+Normal rank
@@ Property / OpenAlex ID @@
+W2092541351
@@ Property / OpenAlex ID: W2092541351 / rank @@
+Normal rank
@@ Property / cites work @@
+On a property of families of sets
@@ Property / cites work: On a property of families of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q5724800
@@ Property / cites work: Q5724800 / rank @@
+Normal rank
@@ Property / cites work @@
+On a combinatorial problem. II
@@ Property / cites work: On a combinatorial problem. II / rank @@
+Normal rank
@@ Property / cites work @@
+Q5477816
@@ Property / cites work: Q5477816 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds and algorithms for hypergraph 2-coloring
+Normal rank
@@ Property / cites work @@
+Hypergraphs with high chromatic number
@@ Property / cites work: Hypergraphs with high chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring uniform hypergraphs with few colors
@@ Property / cites work: Coloring uniform hypergraphs with few colors / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy colorings of uniform hypergraphs
@@ Property / cites work: Greedy colorings of uniform hypergraphs / rank @@
+Normal rank