Panchromatic 3-coloring of a random hypergraph (Q1690010): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2017.07.036
+Normal rank
@@ Property / OpenAlex ID @@
+W2744636876
@@ Property / OpenAlex ID: W2744636876 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4074927
@@ Property / cites work: Q4074927 / rank @@
+Normal rank
@@ Property / cites work @@
+On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
+Normal rank
@@ Property / cites work @@
+On a generalization of Rubin's theorem
@@ Property / cites work: On a generalization of Rubin's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Two‐coloring random hypergraphs
@@ Property / cites work: Two‐coloring random hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold
+Normal rank
@@ Property / cites work @@
+On the chromatic number of a random hypergraph
@@ Property / cites work: On the chromatic number of a random hypergraph / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp thresholds for constraint satisfaction problems and homomorphisms
+Normal rank