Contact graphs of ball packings
arXiv:1707.02526 · doi:10.1016/j.jctb.2020.05.007
Abstract
A contact graph of a packing of closed balls is a graph with balls as vertices and pairs of tangent balls as edges. We prove that the average degree of the contact graph of a packing of balls (with possibly different radii) in is not greater than . We also find new upper bounds for the average degree of contact graphs in and .
References in corpus (6)
- New upper bounds for kissing numbers from semidefinite programming
- High accuracy semidefinite programming bounds for kissing numbers
- Lattices with exponentially large kissing numbers
- Spaces of convex n-partitions
- Ball packings with high chromatic numbers from strongly regular graphs
- Semidefinite programming bounds for the average kissing number