|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
Yu. A. Demidovich, D. A. Shabanov, “On two limit values of the chromatic number of a random hypergraph”, Teor. Veroyatnost. i Primenen., 67:2 (2022), 223–246    ; Theory Probab. Appl., 67:2 (2022), 175–193  |
1
|
|
2021 |
| 2. |
Yu. A. Demidovich, M. E. Zhukovskii, “Chromatic Numbers of Distance Graphs without Short Odd Cycles in Rational Spaces”, Mat. Zametki, 109:5 (2021), 723–733  ; Math. Notes, 109:5 (2021), 727–734  |
1
|
|
2020 |
| 3. |
Yu. A. Demidovich, D. A. Shabanov, “On the chromatic numbers of random hypergraphs”, Dokl. RAN. Math. Inf. Proc. Upr., 494 (2020), 30–34 ; Dokl. Math., 102:2 (2020), 380–383 |
1
|
| 4. |
Yu. A. Demidovich, “New lower bound for the minimal number of edges of simple uniform hypergraph without the property $B_k$”, Diskr. Mat., 32:4 (2020), 10–37 ; Discrete Math. Appl., 32:3 (2022), 155–176 |
| 5. |
Yu. A. Demidovich, “On some generalizations of the property B problem of an $n$-uniform hypergraph”, Fundam. Prikl. Mat., 23:1 (2020), 95–122 ; J. Math. Sci., 262:4 (2022), 457–475 |
2
|
| 6. |
Yu. A. Demidovich, “2-Colorings of Hypergraphs with Large Girth”, Mat. Zametki, 108:2 (2020), 200–214 ; Math. Notes, 108:2 (2020), 188–200 |
1
|
|
2019 |
| 7. |
Yu. A. Demidovich, “Distance Graphs with Large Chromatic Number and without Cliques of Given Size in the Rational Space”, Mat. Zametki, 106:1 (2019), 24–39 ; Math. Notes, 106:1 (2019), 38–51 |
2
|
|
2017 |
| 8. |
Yu. A. Demidovich, “Lower Bound for the Chromatic Number of a Rational Space with Metric $l_u$ and with One Forbidden Distance”, Mat. Zametki, 102:4 (2017), 532–548 ; Math. Notes, 102:4 (2017), 492–507 |
4
|
|
2016 |
| 9. |
Yu. A. Demidovich, A. M. Raigorodskii, “2-Colorings of Uniform Hypergraphs”, Mat. Zametki, 100:4 (2016), 623–626 ; Math. Notes, 100:4 (2016), 629–632 |
4
|
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: