3 papers
math.CO2026
Families without -matchings: the other end
Andrey Kupavskii, Georgy Sokolov
In this paper, we determine the largest family without pairwise disjoint sets, provided for positive integers , and $s \geq s_0(m, c)…
math.CO2025
On forest and bipartite cuts in sparse graphs
Ilya I. Bogdanov, Elizaveta Neustroeva, Georgy Sokolov +3
The paper is devoted to sufficient conditions for the existence of vertex cuts in simple graphs, where the induced subgraph on the cut vertices belongs to a specified graph class.…
math.CO2025
On the chromatic number of the plane for map-type colorings
Georgy Sokolov, Vsevolod Voronov
We consider the Hadwiger-Nelson problem on the chromatic number of the plane under conditions of coloring a map containing a finite number of vertices in any bounded region. Woodal…