Dmitry A. Shabanov

Orcid: 0000-0002-1851-569X

Affiliations:
  • Lomonosov Moscow State University, Russia


According to our database1, Dmitry A. Shabanov authored at least 28 papers between 2007 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs.
Probl. Inf. Transm., 2022

Number of A+B≠C solutions in abelian groups and application to counting independent sets in hypergraphs.
Eur. J. Comb., 2022

2021
Random hypergraphs and property B.
Eur. J. Comb., 2021

On the strong chromatic number of a random 3-uniform hypergraph.
Discret. Math., 2021

2020
Coloring hypergraphs with bounded cardinalities of edge intersections.
Discret. Math., 2020

Estimating the r-colorability threshold for a random hypergraph.
Discret. Appl. Math., 2020

On the weak chromatic number of random hypergraphs.
Discret. Appl. Math., 2020

Equitable colorings of hypergraphs with few edges.
Discret. Appl. Math., 2020

2019
Panchromatic 3-colorings of random hypergraphs.
Eur. J. Comb., 2019

2018
General Independence Sets in Random Strongly Sparse Hypergraphs.
Probl. Inf. Transm., 2018

Colourings of Uniform Hypergraphs with Large Girth and Applications.
Comb. Probab. Comput., 2018

2017
Panchromatic 3-coloring of a random hypergraph.
Electron. Notes Discret. Math., 2017

Colorings of b-simple hypergraphs.
Electron. Notes Discret. Math., 2017

2016
Improved algorithms for colorings of simple hypergraphs and applications.
J. Comb. Theory, Ser. B, 2016

2015
Extremal problems for colorings of simple hypergraphs and applications.
Electron. Notes Discret. Math., 2015

Colorings of hypergraphs with large number of colors.
Electron. Notes Discret. Math., 2015

Equitable two-colorings of uniform hypergraphs.
Eur. J. Comb., 2015

Around Erdős-Lovász problem on colorings of non-uniform hypergraphs.
Discret. Math., 2015

2014
A special issue on the Boris V. Gnedenko Centennial.
Queueing Syst. Theory Appl., 2014

Coloring Non-uniform Hypergraphs Without Short Cycles.
Graphs Comb., 2014

2013
The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model.
Internet Math., 2013

2012
Random coloring method in the combinatorial problem of Erdős and Lovász.
Random Struct. Algorithms, 2012

On r-chromatic hypergraphs.
Discret. Math., 2012

2011
On a generalization of Rubin's theorem.
J. Graph Theory, 2011

On colorings of non-uniform hypergraphs without short cycles.
Electron. Notes Discret. Math., 2011

On r-colorability of random hypergraphs.
CoRR, 2011

2009
On the Problem of Erdos and Hajnal in the Case of List Colorings.
Electron. Notes Discret. Math., 2009

2007
On Some Extremal Properties of Hypergraph Colorings.
Electron. Notes Discret. Math., 2007


  Loading...