A note on random greedy coloring of uniform hypergraphs (Q3452724): Difference between revisions

@@ Property / DOI @@
-.1002/rsa.20556
@@ Property / DOI: 10.1002/rsa.20556 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2963164233
@@ Property / OpenAlex ID: W2963164233 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1368
@@ Property / arXiv ID: 1310.1368 / 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 @@
+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
@@ Property / cites work @@
+Improved bounds and algorithms for hypergraph 2-coloring
+Normal rank
@@ Property / cites work @@
+The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
+Normal rank
@@ Property / cites work @@
+On \(r\)-chromatic hypergraphs
@@ Property / cites work: On \(r\)-chromatic hypergraphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/RSA.20556
@@ Property / DOI: 10.1002/RSA.20556 / rank @@
+Normal rank