Choosability in random hypergraphs (Q1850565): Difference between revisions

@@ Property / OpenAlex ID @@
+W1978476471
@@ Property / OpenAlex ID: W1978476471 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3142409
@@ Property / cites work: Q3142409 / rank @@
+Normal rank
@@ Property / cites work @@
+List coloring of random and pseudo-random graphs
@@ Property / cites work: List coloring of random and pseudo-random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic approach to the Lovász local lemma. I
+Normal rank
@@ Property / cites work @@
+The chromatic number of random graphs
@@ Property / cites work: The chromatic number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Choice Number of Dense Random Graphs
@@ Property / cites work: The Choice Number of Dense Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4705318
@@ Property / cites work: Q4705318 / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of random graphs
@@ Property / cites work: The chromatic number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
+Normal rank
@@ Property / cites work @@
+On the Choice Number of Random Hypergraphs
@@ Property / cites work: On the Choice Number of Random Hypergraphs / rank @@
+Normal rank