G. A. Sokolov

collaborators

2 papers

math.CO2026

Families without $s$ -matchings: the other end

Andrey Kupavskii, Georgy Sokolov

In this paper, we determine the largest family $F \subset 2^{[n]}$ without $s$ pairwise disjoint sets, provided $n = m s + c$ for positive integers $m, c$ , and $s \geq s_0(m, c)…

cs.CC2023

An Exponential Envy-Free Cake Cutting Protocol for $n$ Agents

Georgy Sokolov

We consider a classical envy-free cake cutting problem. The first limited protocol was proposed by Aziz and McKenzie in 2016 arXiv:1604.03655. The disadvantage of this protocol is…

Families without s-matchings: the other end

An Exponential Envy-Free Cake Cutting Protocol for n Agents

Families without $s$ -matchings: the other end

An Exponential Envy-Free Cake Cutting Protocol for $n$ Agents