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

@@ Property / DOI @@
-.2140/moscow.2023.12.57
@@ Property / DOI: 10.2140/moscow.2023.12.57 / rank @@
-Normal rank
@@ Property / author @@
-Q2145752
@@ Property / author: Q2145752 / rank @@
-Normal rank
@@ Property / author @@
-Dmitriy A. Shabanov
@@ Property / author: Dmitriy A. Shabanov / rank @@
-Normal rank
@@ Property / author @@
+Alina E. Khuzieva
@@ Property / author: Alina E. Khuzieva / rank @@
+Normal rank
@@ Property / author @@
+Dmitriy A. Shabanov
@@ Property / author: Dmitriy A. Shabanov / rank @@
+Normal rank
@@ 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.2140/moscow.2023.12.57
+Normal rank
@@ Property / OpenAlex ID @@
+W4361285729
@@ Property / OpenAlex ID: W4361285729 / rank @@
+Normal rank
@@ 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
@@ Property / DOI @@
+.2140/MOSCOW.2023.12.57
@@ Property / DOI: 10.2140/MOSCOW.2023.12.57 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2694278