01.01.05 (Probability theory and mathematical statistics)
E-mail:
Main publications:
J. Kozik, D.A. Shabanov, “Improved algorithms for colorings of simple hypergraphs and applications”, Journal of Combinatorial Theory, Series B, 116 (2016), 312-332
D.A. Shabanov, “Equitable two-colorings of uniform hypergraphs”, European Journal of Combinatorics, 43 (2015), 185–203
D. A. Shabanov, “Random coloring method in the combinatorial problem of Erdős and Lov\asz”, Random Structures and Algorithms, 40:2 (2012), 227 – 253
D. A. Shabanov, “On $r$-chromatic hypergraphs”, Discrete Mathematics, 312:2 (2012), 441-458
A. M. Raigorodskii, D. A. Shabanov, “Zadacha Erdesha – Khainala o raskraskakh gipergrafov, ee obobscheniya i smezhnye problemy”, Uspekhi matematicheskikh nauk, 66:5 (2011), 109–182; A.M. Raigorodskii, D. A. Shabanov, “The Erdős–Hajnal problem, its generalizations and related problems”, Russian Mathematical Surveys, 66:5 (2011), 933–1002
M. Koshelev, D. A. Shabanov, T. M. Shaikheeva, Uspekhi Mat. Nauk (to appear)
2.
I. O. Denisov, D. A. Shabanov, “On the concentration of values of $j$-chromatic numbers of random hypergraphs”, Dokl. Math., 107:1 (2023), 21–27
3.
D. N. Tyapkin, D. A. Shabanov, “On the structure of the set of panchromatic colorings of a random hypergraph”, Dokl. Math., 108:1 (2023), 286–290
4.
P. A. Zakharov, D. A. Shabanov, “Fractional colourings of random hypergraphs”, Russian Math. Surveys, 78:6 (2023), 1161–1163
5.
Yu. A. Demidovich, D. A. Shabanov, “On two limit values of the chromatic number of a random hypergraph”, Theory Probab. Appl., 67:2 (2022), 175–193
6.
Aliaksei Semchankau, Dmitry Shabanov, Ilya Shkredov, “Number of $A+B \neq C$ solutions in abelian groups and application to counting independent sets in hypergraphs”, European J. Combin., 100 (2022), 103453 , 13 pp.
7.
A. S. Semenov, D. A. Shabanov, “Bounds on threshold probabilities for coloring properties of random hypergraphs”, Problems Inform. Transmission, 58:1 (2022), 72–101
8.
T. G. Matveeva, A. E. Khuzieva, D. A. Shabanov, “On the strong chromatic number of random hypergraphs”, Dokl. Math., 105:1 (2022), 31–34
9.
I. O. Denisov, D. A. Shabanov, “On the concentration of the independence numbers of random hypergraphs”, Discrete Math. Appl., 33:1 (2023), 7–18
10.
P. A. Zakharov, D. A. Shabanov, “On the maximal cut in a random hypergraph”, Dokl. Math., 104:3 (2021), 336–339
11.
D. A. Shabanov, T. M. Shaikheeva, “The List-Chromatic Number of Complete Multipartite Hypergraphs and Multiple Covers by Independent Sets”, Math. Notes, 107:3 (2020), 499–508
12.
A. Semenov, D. Shabanov, “On the weak chromatic number of random hypergraphs”, Discrete Applied Mathematics, 276 (2020), 134–154
M. Akhmejanova, D. Shabanov, “Coloring hypergraphs with bounded cardinalities of edge intersections”, Discrete Mathematics, 343:4 (2020), 111692 , 11 pp.
S.A. Kargaltsev, D.A. Shabanov, T.M. Shaikheeva, “Two values of the chromatic number of a sparse random graph”, Acta Mathematica Universitatis Comenianae, 88:3 (2019), 849–854
20.
A. Balobanov, D. A. Shabanov, “On the Number of Independent Sets in Simple Hypergraphs”, Math. Notes, 103:1 (2018), 33–41
21.
A. S. Semenov, D. A. Shabanov, “General Independence Sets in Random Strongly Sparse Hypergraphs”, Problems Inform. Transmission, 54:1 (2018), 56–69
22.
D. A. Kravtsov, N. E. Krokhmal, D. A. Shabanov, “On panchromatic colourings of a random hypergraph”, Russian Math. Surveys, 73:4 (2018), 731–733
23.
Andrey Kupavskii, Dmitry Shabanov, “Colourings of uniform hypergraphs with large girth and applications”, Comb. Probab. Comput., 27:2 (2018), 245–273
Alina Khuzieva, Dmitry Shabanov, Polina Svyatokum, “On-line and list on-line colorings of graphs and hypergraphs”, Moscow J. Combin. Number Theory, 7:4 (2017), 39–57
27.
Dmitry Kravtsov, Nikolay Krokhmal, Dmitry Shabanov, “Panchromatic 3-coloring of a random hypergraph”, Electron. Notes Discrete Math., 61 (2017), 781–787
28.
D. A. Shabanov, “On the concentration of the chromatic number of a random hypergraph”, Dokl. Math., 96:1 (2017), 321–325
29.
A. S. Semenov, D. A. Shabanov, “Independence numbers of random sparse hypergraphs”, Discrete Math. Appl., 27:4 (2017), 231–245
30.
Jakub Kozik, Dmitry Shabanov, “Improved algorithms for colorings of simple hypergraphs and applications”, J. Comb. Theory, Ser. B, 116 (2016), 312–332
A. E. Khuzieva, D. A. Shabanov, “On regular hypergraphs with high girth and high chromatic number”, Discrete Math. Appl., 25:5 (2015), 277–294
33.
A. E. Khuzieva, D. A. Shabanov, “Quantitative Estimates of Characteristics for Hypergraphs of Large Girth and Large Chromatic Number”, Math. Notes, 98:6 (2015), 995–998
34.
Jakub Kozik, Dmitry Shabanov, “Extremal problems for colorings of simple hypergraphs and applications”, Electron. Notes Discrete Math., 49 (2015), 441–445
35.
Ilia Akolzin, Dmitry Shabanov, “Colorings of hypergraphs with large number of colors”, Electron. Notes Discrete Math., 49 (2015), 407–411
36.
Dmitry A. Shabanov, “Around Erdős–Lovász problem on colorings of non-uniform hypergraphs”, Discrete Math., 338:11 (2015), 1976–1981
37.
Dmitry A. Shabanov, “Equitable two-colorings of uniform hypergraphs”, European J. Combin., 43 (2015), 185–203
D. A. Shabanov, “A generalization of the Hajnal–Szemeredi theorem for uniform hypergraphs”, Dokl. Math., 90:3 (2014), 671–674
40.
A. B. Kupavskii, D. A. Shabanov, “Colorings of partial Steiner systems and their applications”, J. Math. Sci., 206:5 (2015), 511–538
41.
Andrey Kupavskii, Liudmila Ostroumova, Dmitriy Shabanov, Prasad Tetali, “The distribution of second degrees in the Buckley–Osthus random graph model”, Internet Math., 9:4 (2013), 297–335
A. B. Kupavskii, D. A. Shabanov, “Colorings of uniform hypergraphs with large girth”, Dokl. Math., 85:2 (2012), 247–250
48.
D. A. Shabanov, “Van der Waerden's function and colourings of hypergraphs”, Izv. Math., 75:5 (2011), 1063–1091
49.
A. P. Rozovskaya, D. A. Shabanov, “Improvement of the Lower Bound in the Kostochka Problem of Panchromatic Coloring of a Hypergraph”, Math. Notes, 89:6 (2011), 903–906
50.
A. M. Raigorodskii, D. A. Shabanov, “The Erdős–Hajnal problem of hypergraph colouring, its generalizations, and related problems”, Russian Math. Surveys, 66:5 (2011), 933–1002
51.
D. A. Shabanov, “On a generalization of Rubin's theorem”, Journal of Graph Theory, 67:3 (2011), 226–234
52.
D. A. Shabanov, “On coloring uniform hypergraphs without 3-cycles”, Moscow Journal of Combinatorics and Number Theory, 1:2 (2011), 180–206
53.
D. A. Shabanov, A. P. Rozovskaya, “On colorings of non-uniform hypergraphs without short cycles”, Electronic Notes in Discrete Mathematics, 38 (2011), 749-754
54.
D. A. Shabanov, “On the Lower Bound for van der Waerden Functions”, Math. Notes, 87:6 (2010), 918–920
55.
D. A. Shabanov, “The existence of panchromatic colourings for uniform hypergraphs”, Sb. Math., 201:4 (2010), 607–630
56.
A. P. Rozovskaya, D. A. Shabanov, “On proper colourings of hypergraphs using prescribed colours”, Discrete Math. Appl., 20:4 (2010), 391–409
57.
D. A. Shabanov, “Lower bounds in the combinatorial problem of Erdős and Lovász”, Doklady Mathematics, 81:2 (2010), 286–288
58.
D. A. Shabanov, “Lower bounds for the number of edges in hypergraphs of certain classes”, Doklady Mathematics, 82:2 (2010), 705–708
59.
D. A. Shabanov, “On the Chromatic Number of Finite Systems of Subsets”, Math. Notes, 85:6 (2009), 902–905
60.
A. P. Rozovskaya, M. V. Titova, D. A. Shabanov, “On balanced colorings of hypergraphs”, J. Math. Sci., 169:5 (2010), 654–670
61.
D. A. Shabanov, “Improvement of the lower bound in the Erdös-Hajnal combinatorial problem”, Dokl. Math., 79:3 (2009), 349–350
62.
D. A. Shabanov, “Improvement of the lower bound in the Erdős - Hajnal combinatorial problem”, Doklady Mathematics, 79:3 (2009), 349–350
63.
D. A. Shabanov, A. P. Rozovskaya, “On the problem of Erdős and Hajnal in the case of list colorings”, Electronic Notes in Discrete Mathematics, 34 (2009), 387–391
64.
D. A. Shabanov, “Randomized algorithms for colourings of hypergraphs”, Sb. Math., 199:7 (2008), 1089–1110
65.
D. A. Shabanov, “Extremal problems for colourings of uniform hypergraphs”, Izv. Math., 71:6 (2007), 1253–1290
66.
D. A. Shabanov, “On the vertex number of almost bipartite hypergraphs”, Doklady Mathematics, 75:1 (2007), 25–27
67.
D. A. Shabanov, “On colorings of hypergraphs”, Doklady Mathematics, 71:3 (2005), 438–442
68.
D. A. Shabanov, “On a combinatorial problem of Erdős”, Dokl. Math., 69:3 (2004), 359–362;
Problems for colorings of sparse random hypergraphs Dmitry Shabanov, Daniil Tiapkin, Pavel Zakharov International Conference "Theory of Probability and Its Applications: P. L. Chebyshev – 200" (The 6th International Conference on Stochastic Methods) May 22, 2021 11:30
Contact us: