Roman Prosanov

1. A new proof of the Larman–Rogers upper bound for the chromatic number of the Euclidean space
   2019/09/25 by Roman Prosanov, Роман Просанов · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
2. Second-order rigidity of coned polytope frameworks and the stress-flex conjecture from a vector-valued Schläfli formula
   2026/07/16 by Eleni Pachyli, Roman Prosanov, Martin Winter
   #math.MG #math.CO