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ász”, 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
A. S. Semenov, D. A. Shabanov, Diskr. Mat., 28:3 (2016), 126–144
5.
I.A. Akolzin, D.A. Shabanov, “Colorings of hypergraphs with large number of colors”, Discrete Mathematics, 339:12 (2016), 3020–3031
6.
J. Kozik, D.A. Shabanov, “Improved algorithms for colorings of simple hypergraphs and applications”, Journal of Combinatorial Theory, Series B, 116 (2016), 312–332 (cited: 1)
2015
7.
A. E. Khuzieva, D. A. Shabanov, “On regular hypergraphs with high girth and high chromatic number”, Discrete Math. Appl., 25:5 (2015), 277–294
8.
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
9.
A. B. Kupavskii, D. A. Shabanov, “Colorings of partial Steiner systems and their applications”, J. Math. Sci., 206:5 (2015), 511–538 (cited: 1)
2012
10.
A. P. Rozovskaya, D. A. Shabanov, “Extremal problems for panchromatic colourings of uniform hypergraphs”, Discrete Math. Appl., 22:2 (2012), 185–206
2011
11.
D. A. Shabanov, “Van der Waerden's function and colourings of hypergraphs”, Izv. Math., 75:5 (2011), 1063–1091 (cited: 1) (cited: 1) (cited: 1) (cited: 2)
12.
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 (cited: 2) (cited: 1) (cited: 1) (cited: 2)
13.
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 (cited: 13) (cited: 9) (cited: 9) (cited: 13)
2010
14.
D. A. Shabanov, “On the Lower Bound for van der Waerden Functions”, Math. Notes, 87:6 (2010), 918–920 (cited: 1) (cited: 1) (cited: 1) (cited: 1)
15.
D. A. Shabanov, “The existence of panchromatic colourings for uniform hypergraphs”, Sb. Math., 201:4 (2010), 607–630 (cited: 5) (cited: 4) (cited: 4) (cited: 4)
16.
A. P. Rozovskaya, D. A. Shabanov, “On proper colourings of hypergraphs using prescribed colours”, Discrete Math. Appl., 20:4 (2010), 391–409 (cited: 2) (cited: 2) (cited: 2)
2009
17.
D. A. Shabanov, “On the Chromatic Number of Finite Systems of Subsets”, Math. Notes, 85:6 (2009), 902–905 (cited: 7) (cited: 6) (cited: 6) (cited: 6)
2010
18.
A. P. Rozovskaya, M. V. Titova, D. A. Shabanov, “On balanced colorings of hypergraphs”, J. Math. Sci., 169:5 (2010), 654–670 (cited: 1) (cited: 1) (cited: 1)
2009
19.
D. A. Shabanov, “Improvement of the lower bound in the Erdös-Hajnal combinatorial problem”, Dokl. Math., 79:3 (2009), 349–350 (cited: 5) (cited: 6) (cited: 6) (cited: 6)
2008
20.
D. A. Shabanov, “Randomized algorithms for colourings of hypergraphs”, Sb. Math., 199:7 (2008), 1089–1110 (cited: 1) (cited: 2)
2007
21.
D. A. Shabanov, “Extremal problems for colourings of uniform hypergraphs”, Izv. Math., 71:6 (2007), 1253–1290 (cited: 9) (cited: 7) (cited: 7) (cited: 6)
2004
22.
D. A. Shabanov, “On a combinatorial problem of Erdős”, Dokl. Math., 69:3 (2004), 359–362
23.
D. A. Kravtsov, N. E. Krokhmal, D. A. Shabanov, Uspekhi Mat. Nauk (to appear)
2018
Terms of Use