D. Shabanov

发表

Van der Waerden function and colorings of hypergraphs with large girth

D. Shabanov, 2013 .

Two values of the chromatic number of a sparse random graph

D. Shabanov, Stepan Kargaltsev, T. Shaikheeva, 2019 .

On the concentration of the chromatic number of a random hypergraph

D. Shabanov, 2017 .

Colorings of uniform hypergraphs with large girth

A. Kupavskii, D. Shabanov, 2012 .

Lower bounds for the number of edges in hypergraphs of certain classes

D. Shabanov, 2010 .

On proper colourings of hypergraphs using prescribed colours

D. Shabanov, A. P. Rozovskaya, 2010 .

Improvement of the lower bound in the Erdös-Hajnal combinatorial problem

D. Shabanov, 2009 .

On the chromatic number of finite systems of subsets

D. Shabanov, 2009 .

A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs

D. Shabanov, 2014 .

On balanced colorings of hypergraphs

M. V. Titova, D. Shabanov, A. P. Rozovskaya, 2010 .

The List-Chromatic Number of Complete Multipartite Hypergraphs and Multiple Covers by Independent Sets

D. Shabanov, T. Shaikheeva, 2020 .

On r-colorability of random hypergraphs

D. Shabanov, A. Kupavskii, 2011, ArXiv.

Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph

D. Shabanov, A. P. Rozovskaya, D. Shabanov, 2011 .

Lower bounds in the combinatorial problem of Erdös and Lovász

D. Shabanov, 2010 .

Coloring Non-uniform Hypergraphs Without Short Cycles

D. Shabanov, 2013, Graphs and Combinatorics.

Number of A+B≠C solutions in abelian groups and application to counting independent sets in hypergraphs

I. Shkredov, D. Shabanov, A. Semchankau, 2020, Eur. J. Comb..

Equitable colorings of hypergraphs with few edges

Dmitry A. Shabanov, Margarita Akhmejanova, D. Shabanov, 2019, Discret. Appl. Math..

Random hypergraphs and property B

Dmitry A. Shabanov, Jakub Kozik, Lech Duraj, 2020, Eur. J. Comb..

On the list chromatic number of the complete multi-partite hypergraphs and multiple coverings by independent sets

D. Shabanov, T. Shaikheeva, 2017 .

Colorings of hypergraphs with large number of colors

Dmitry A. Shabanov, Ilia Akolzin, D. Shabanov, 2015, Electron. Notes Discret. Math..

Coloring Non-uniform Hypergraphs Without Short Cycles

Dmitry A. Shabanov, D. Shabanov, 2014, Graphs Comb..

Random coloring method in the combinatorial problem of Erdős and Lovász

Dmitry A. Shabanov, D. Shabanov, 2012, Random Struct. Algorithms.

On r-chromatic hypergraphs

Dmitry A. Shabanov, D. Shabanov, 2012, Discret. Math..

On the Problem of Erdos and Hajnal in the Case of List Colorings

Anastasia P. Rozovskaya, Dmitry A. Shabanov, D. Shabanov, 2009, Electron. Notes Discret. Math..

Randomized algorithms for colourings of hypergraphs

D. Shabanov, 2008 .

Extremal problems for colourings of uniform hypergraphs

D. Shabanov, D. A. Shabanov, 2007 .

General Independence Sets in Random Strongly Sparse Hypergraphs

Dmitry A. Shabanov, A. S. Semenov, A. S. Semenov, 2018, Probl. Inf. Transm..

The Distribution of Second Degrees in the Buckley–Osthus Random Graph Model

Liudmila Ostroumova, Andrey Kupavskii, Prasad Tetali, 2013, Internet Math..

On the weak chromatic number of random hypergraphs

Dmitry A. Shabanov, Alexander N. Semenov, A. Semenov, 2020, Discret. Appl. Math..

On a generalization of Rubin's theorem

Dmitry A. Shabanov, D. Shabanov, 2011, J. Graph Theory.

Colorings of Partial Steiner Systems and Their Applications

D. A. Shabanov, A. Kupavskii, A. Kupavskii, 2015 .

Panchromatic 3-colorings of random hypergraphs

Dmitry A. Shabanov, Dmitry Kravstov, Nikolay Krokhmal, 2019, Eur. J. Comb..