2020/11/19 by Almohammad, Sami Mezal, Naszódi, Márton, Lángi, Zsolt
#52A30 #52B05 #52B10 #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)
paper · doi:10.48550/arxiv.2011.10105
Steinitz's theorem states that a graph G is the edge-graph of a 3-dimensional convex polyhedron if and only if, G is simple, plane and 3-connected. We prove an analogue of this theorem for ball polyhedra, that is, for intersections of finitely many unit balls in ℝ3.