G. A. Sokolov

1. On forest and bipartite cuts in sparse graphs
   2025/05/22 by Ilya I. Bogdanov, Bogdanov, Ilya I., Elizaveta Andreevna Neustroeva +8 · 4 citations
   Computer Science · Mathematics · #05C35 #05C40 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Limits and Structures in Graph Theory
2. A complete solution of the Erdős-Kleitman matching problem for n≤ 3s
   2025/11/26 by Andrey Kupavskii, G. A. Sokolov, Kupavskii, Andrey +1 · 1 citation
   Mathematics · #Analytic Number Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods