• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Language Proficiency
+7 (495) 772-95-90
Address: 11 Pokrovsky Bulvar, Pokrovka Complex, room T905
SPIN-RSCI: 5581-4044
ORCID: 0000-0002-1851-569X
ResearcherID: J-4981-2012
Scopus AuthorID: 6602787390
Google Scholar
E. Sokolov
Printable version


Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!
To be used only for spelling or punctuation mistakes.

Dmitry A. Shabanov

  • Dmitry A. Shabanov has been at HSE University since 2015.

Education, Degrees and Academic Titles

  • 2018
    Associate Professor
  • 2013

    Doctor of Sciences*

  • 2008

    Candidate of Sciences* (PhD)

  • 2005

    Degree in Mathematics
    Lomonosov Moscow State University

* Candidate of Sciences
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
* Doctor of Sciences
A post-doctoral degree called Doctor of Sciences is given to reflect second advanced research qualifications or higher doctorates in ISCED 2011.

Awards and Accomplishments

Courses (2023/2024)

Courses (2022/2023)

Courses (2021/2022)

Courses (2020/2021)

Courses (2019/2020)

Courses (2018/2019)

Courses (2017/2018)



  • 2019
    "Stochastic Days" in honor of Albert Shiryaev's 85th birthday (Москва). Presentation: Concentration of the chromatic number of a random graph
  • European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2019) (Братислава). Presentation: Two values of the chromatic number of a sparse random graph
  • 2018
    The First Southwestern German Workshop on Graph Theory ( Карлсруэ). Presentation: Panchromatic colorings of sparse random hypergraphs
  • The Second Russian-Hungarian Combinatorial Workshop (Будапешт). Presentation: On the strong chromatic number of a random 3-uniform hypergraph
  • 2017
    Vilnius Conference in Combinatorics and Number Theory (Вильнюс). Presentation: The Erdos-Hajnal problem on colorings of hypergraphs, its on-line generalizations and related questions
  • European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2017) (Вена). Presentation: Panchromatic 3-coloring of a random hypergraph
  • 2016
    SIAM conference on Discrete Mathematics (DM16) (Атланта). Presentation: Colorings of hypergraphs with large number of colors
  • 2015
    European Conference on Combinatorics, Graph Theory and Applications (Берген). Presentation: Extremal problems for colorings of simple hypergraphs and applications

Editorial board membership

2021: Member of the Editorial Board, Дискретная математика (Discrete Mathematics and Applications).

Timetable for today

Full timetable

Ilya Segalovich Scholarship Winners Interviews. Part 1

The winners of the Ilya Segalovich Scholarship were announced recently. We talked to them about the award, their studies and their projects.