2 citations · 2 across the 2 of their papers we have counts for
4 papers
Random hypergraphs and property B
Lech Duraj, Jakub Kozik, Dmitry Shabanov
In 1964 Erdős proved that $(1+\oh{1})) \frac{\eul \ln(2)}{4} k^2 2^{k}$ edges are sufficient to build a -graph which is not two colorable. To this day, it is not known whether t…
Number of solutions in abelian groups and application to counting independent sets in hypergraphs
Aliaksei Semchankau, Dmitry Shabanov, Ilya Shkredov
The paper deals with a problem of Additive Combinatorics. Let be a finite abelian group of order . We prove that the number of subset triples $A,B,C\subset {\mathb…
Equitable colorings of hypergraphs with few edges
Margarita Akhmejanova, Dmitry Shabanov
The paper deals with an extremal problem concerning equitable colorings of uniform hyper\-graph. Recall that a vertex coloring of a hypergraph is called proper if there are no…
Coloring hypergraphs with bounded cardinalities of edge intersections
Margarita Akhmejanova, Dmitry Shabanov
The paper deals with an extremal problem concerning colorings of hypergraphs with bounded edge degrees. Consider the family of -simple hypergraphs, in which any two edges do not…