4 problems
Let and consider a packing of circular disks whose radii all lie in an interval . Stability conjecture. There exists an such that, for eve…
A graph is a generic-radii sphere-packing contact graph if it is the contact graph of a sphere packing whose radii are generic. NP-hardness conjecture. Determining whether a graph…
Let be the contact graph of a sphere packing with generic radii, where generic means that the radii form an algebraically independent set. Regard as a bar-and-joi…
Let be a packing of disks of radius in the hyperbolic plane , and let denote the average degree of its…