JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
Shabanov Dmitry Aleksandrovich
Statistics Math-Net.Ru
Total publications: 15
Scientific articles: 15
in MathSciNet: 17
in zbMATH: 9
in Web of Science: 11
in Scopus: 15
Cited articles: 11
Citations in Math-Net.Ru: 62
Presentations: 15
Number of views: This page: 1609 Abstract pages: 3824 Full texts: 750 References: 286
Doctor of physico-mathematical sciences (2013)
Speciality:
01.01.05 (Probability theory and mathematical statistics)
E-mail:
email , email
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 Russian Mathematical Surveys , 66 :5 (2011), 933–1002
http://www.mathnet.ru/eng/person19203
List of publications on Google Scholar
List of publications on ZentralBlatt
Publications in Math-Net.Ru
1.
О числах независимости случайных разреженных гиперграфов Diskr. Mat. , 28 :3 (2016), 126–144
2.
On regular hypergraphs with high girth and high chromatic number Diskr. Mat. , 27 :2 (2015), 112–133
3.
Quantitative Estimates of Characteristics for Hypergraphs of Large Girth and Large Chromatic Number Mat. Zametki , 98 :6 (2015), 948–951
4.
Colorings of partial Steiner systems and their applications Fundam. Prikl. Mat. , 18 :3 (2013), 77–115
5.
Extremal problems for panchromatic colourings of uniform hypergraphs Diskr. Mat. , 24 :2 (2012), 104–122
6.
Van der Waerden's function and colourings of hypergraphs Izv. RAN. Ser. Mat. , 75 :5 (2011), 195–224
7.
Improvement of the Lower Bound in the Kostochka Problem of Panchromatic Coloring of a Hypergraph Mat. Zametki , 89 :6 (2011), 948–950
8.
The Erdős–Hajnal problem of hypergraph colouring, its generalizations, and related problems Uspekhi Mat. Nauk , 66 :5(401) (2011), 109–182
9.
On proper colourings of hypergraphs using prescribed colours Diskr. Mat. , 22 :3 (2010), 94–109
10.
On the Lower Bound for van der Waerden Functions Mat. Zametki , 87 :6 (2010), 951–953
11.
The existence of panchromatic colourings for uniform hypergraphs Mat. Sb. , 201 :4 (2010), 137–160
12.
Improvement of the lower bound in the Erdös-Hajnal combinatorial problem Dokl. Akad. Nauk , 426 :2 (2009), 177–178
13.
On balanced colorings of hypergraphs Fundam. Prikl. Mat. , 15 :7 (2009), 141–163
14.
On the Chromatic Number of Finite Systems of Subsets Mat. Zametki , 85 :6 (2009), 951–954
15.
Randomized algorithms for colourings of hypergraphs Mat. Sb. , 199 :7 (2008), 139–160
16.
Extremal problems for colourings of uniform hypergraphs Izv. RAN. Ser. Mat. , 71 :6 (2007), 183–222
17.
On a combinatorial problem of Erdős Dokl. Akad. Nauk , 396 :2 (2004), 166–169
Presentations in Math-Net.Ru
1.
О хроматическом числе разреженного случайного гиперграфа Contemporary Problems in Number Theory March 9, 2017
2.
Предписанное хроматическое число полных многодольных графов и кратные покрытия независимыми множествами November 1, 2016
3.
Раскраски гиперграфов и смежные проблемы: вероятностно-алгоритмический подход Colloquium of the Faculty of Computer Science October 25, 2016
4.
Независимые множества в гиперграфах Contemporary Problems in Number Theory October 1, 2015
5.
Гиперграфы с очень большим хроматическим числом October 21, 2014
6.
Improved algorithms for colorings of simple hypergraphs and applications Workshop on Extremal Graph Theory June 6, 2014 11:30
7.
Раскраски простых гиперграфов в приложении к теореме Ван дер Вардена Contemporary Problems in Number Theory April 3, 2014 12:45
8.
Van der Waerden's theorem and colourings of hypergraphs Dobrushin Mathematics Laboratory Seminar January 24, 2012 16:00
9.
О двух подходах к оцениванию функции Ван дер Вардена (продолжение) Contemporary Problems in Number Theory December 8, 2011 12:45
10.
Экстремальные и вероятностные задачи теории гиперграфов и аддитивной комбинаторики Principle Seminar of the Department of Probability Theory, Moscow State University October 5, 2011 16:45
11.
Задачи аддитивной комбинаторики и раскраски гиперграфов Contemporary Problems in Number Theory May 5, 2011 12:45
12.
Экстремальные задачи о раскрасках гиперграфов и их приложения в комбинаторной теории чисел Seminar of the Department of Discrete Mathematics, Steklov Mathematical Institute of RAS March 1, 2011 16:00
13.
Метод случайной раскраски гиперграфов в задачах экстремальной комбинаторики Principle Seminar of the Department of Probability Theory, Moscow State University November 24, 2010 16:45
14.
Случайные гиперграфы и задачи экстремальной комбинаторики Principle Seminar of the Department of Probability Theory, Moscow State University September 8, 2010 16:45
15.
Вероятностные методы в некоторых задачах теории гиперграфов Principle Seminar of the Department of Probability Theory, Moscow State University February 15, 2006
Organisations
Terms of Use