Роман Просанов
- A new proof of the Larman-Rogers upper bound for the chromatic number of\n the Euclidean space
2016/10/10 by Роман Просанов, Prosanov, Roman · 2 citations
Mathematics · #52C10 (Primary) #52C17 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Metric Geometry (math.MG)
- 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