Estimating the strong \(r\)-colorability threshold in random hypergraphs (Q2694278): Difference between revisions

@@ Property / cites work @@
+Q4705349
@@ Property / cites work: Q4705349 / rank @@
+Normal rank
@@ Property / cites work @@
+The two possible values of the chromatic number of a random graph
+Normal rank
@@ Property / cites work @@
+Hypergraph coloring up to condensation
@@ Property / cites work: Hypergraph coloring up to condensation / rank @@
+Normal rank
@@ Property / cites work @@
+On the strong chromatic number of a random 3-uniform hypergraph
+Normal rank
@@ Property / cites work @@
+Upper-bounding the \(k\)-colorability threshold by counting covers
+Normal rank
@@ Property / cites work @@
+The Chromatic Number of Random Graphs for Most Average Degrees
+Normal rank
@@ Property / cites work @@
+On the chromatic number of random graphs
@@ Property / cites work: On the chromatic number of random graphs / rank @@
+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
@@ 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 @@
+Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
+Normal rank
@@ Property / cites work @@
+Estimating the \(r\)-colorability threshold for a random hypergraph
+Normal rank