| Publication | Date of Publication | Type |
|---|
On the chromatic numbers of 3-dimensional slices
(available as arXiv preprint) | N/A | Paper |
Steiner trees with infinitely many terminals on the sides of an angle
(available as arXiv preprint) | N/A | Paper |
Universal optimality of T-avoiding spherical codes and designs
Constructive Approximation | 2026-08-06 | Paper |
On the minimal sum of edge weights in a signed edge-dominated graph. II
Mathematical Notes | 2026-06-24 | Paper |
On chromatic numbers of 3-dimensional slices
Journal of Mathematical Sciences (New York) | 2026-06-17 | Paper |
Around the number of trees in distance-hereditary graphs
Discrete Mathematics | 2026-03-12 | Paper |
Branching points in the planar Gilbert-Steiner problem have degree 3
Pure and Applied Functional Analysis | 2025-06-23 | Paper |
On stability of weighted spanning tree degree enumerators
Izvestiya: Mathematics | 2025-05-12 | Paper |
Steiner trees with infinitely many terminals on the sides of an angle
Journal of Combinatorial Optimization | 2025-04-04 | Paper |
On set systems without singleton intersections
DML. Discrete Mathematics Letters | 2025-03-25 | Paper |
Universal optimality of T-avoiding spherical codes and designs
(available as arXiv preprint) | 2025-01-01 | Paper |
The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
Results in Mathematics | 2024-12-23 | Paper |
On uniqueness in Steiner problem
IMRN. International Mathematics Research Notices | 2024-10-25 | Paper |
On the chromatic number of 2-dimensional spheres
Discrete & Computational Geometry | 2024-02-09 | Paper |
Erdős-Hajnal problem for \(H\)-free hypergraphs
Graphs and Combinatorics | 2024-01-29 | Paper |
On set systems without singleton intersections
(available as arXiv preprint) | 2024-01-01 | Paper |
The number of trees in distance-hereditary graphs and their friends
(available as arXiv preprint) | 2024-01-01 | Paper |
| The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000 | 2023-12-08 | Paper |
| On stability of weighted spanning tree degree enumerators | 2023-10-27 | Paper |
On stability of spanning tree degree enumerators
Discrete Mathematics | 2023-10-04 | Paper |
| Branching points in the planar Gilbert--Steiner problem have degree 3 | 2023-09-08 | Paper |
Independence numbers of Johnson-type graphs
Bulletin of the Brazilian Mathematical Society. New Series | 2023-07-12 | Paper |
| On small non-uniform hypergraphs without property B | 2023-03-07 | Paper |
| An overview of maximal distance minimizers problem | 2022-12-11 | Paper |
| Inverse maximal and average distance minimizer problems | 2022-12-04 | Paper |
Lovász theta approach to eventown problem
Linear Algebra and its Applications | 2022-10-18 | Paper |
On the minimal sum of edges in a signed edge-dominated graph
The Electronic Journal of Combinatorics | 2022-09-06 | Paper |
| Maximal distance minimizers for a rectangle | 2021-06-01 | Paper |
On the Erdős-Hajnal problem for 3-graphs
Journal of Mathematical Sciences (New York) | 2021-05-26 | Paper |
| On list chromatic numbers of 2-colorable hypergraphs | 2021-02-04 | Paper |
| On minimizers of the maximal distance functional for a planar convex closed smooth curve | 2020-11-20 | Paper |
Regular behavior of the maximal hypergraph chromatic number
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
Extremal problems in hypergraph colourings
Russian Mathematical Surveys | 2020-05-29 | Paper |
On small \(n\)-uniform hypergraphs with positive discrepancy
Journal of Combinatorial Theory. Series B | 2019-11-21 | Paper |
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
European Journal of Combinatorics | 2019-06-18 | Paper |
| On the Erd{\H o}s--Hajnal problem in the case of 3-graphs | 2019-05-07 | Paper |
On the Erdős--Hajnal problem in the case of 3-graphs
(available as arXiv preprint) | 2019-01-01 | Paper |
On the horseshoe conjecture for maximal distance minimizers
ESAIM: Control, Optimisation and Calculus of Variations | 2018-12-21 | Paper |
| On a question of Sidorenko | 2018-12-20 | Paper |
| On uniqueness in Steiner problem | 2018-09-05 | Paper |
On the chromatic number of an infinitesimal plane layer
St. Petersburg Mathematical Journal | 2018-08-15 | Paper |
Coloring cross-intersecting families
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Coloring cross-intersecting families
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
On the chromatic numbers of small-dimensional Euclidean spaces
Discrete Applied Mathematics | 2018-05-24 | Paper |
Weak forms of shadowing in topological dynamics
Topological Methods in Nonlinear Analysis | 2018-03-16 | Paper |
A note on panchromatic colorings
Discrete Mathematics | 2018-01-19 | Paper |
On a question of Sidorenko
(available as arXiv preprint) | 2018-01-01 | Paper |
On the chromatic numbers of low-dimensional spaces
Doklady Mathematics | 2017-06-15 | Paper |
A note on random greedy coloring of uniform hypergraphs
Random Structures & Algorithms | 2015-11-13 | Paper |
| Multishadowing in topological dynamics | 2015-06-18 | Paper |
Multishadowing in topological dynamics
(available as arXiv preprint) | 2015-01-01 | Paper |
| A new randomized algorithm for the Erdos--Hajnal problem | 2013-08-30 | Paper |
A new randomized algorithm for the Erdos--Hajnal problem
(available as arXiv preprint) | 2013-01-01 | Paper |
On hypergraph cliques with chromatic number 3
Moscow Journal of Combinatorics and Number Theory | 2012-09-05 | Paper |
On two-colorings of hypergraphs
Doklady Mathematics | 2012-01-17 | Paper |
| About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3 | 2011-10-08 | Paper |
| About maximal number of edges in hypergraph-clique with chromatic number 3 | 2011-07-10 | Paper |
About maximal number of edges in hypergraph-clique with chromatic number 3
(available as arXiv preprint) | 2011-01-01 | Paper |
About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
(available as arXiv preprint) | 2011-01-01 | Paper |
