Discrete Comput Geom DOI 10.1007/s00454-016-9777-3 Apollonian Ball Packings and Stacked Polytopes Hao Chen1 Received: 28 December 2013 / Revised: 4 March 2016 / Accepted: 9 March 2016 © The Author(s) 2016. This article is published with open access at Springerlink.com Abstract We investigate in this paper the relation between Apollonian d-ball packings and stacked (d + 1)-polytopes for dimension d ≥ 3. For d = 3, the relation is fully described: we prove that the 1-skeleton of a stacked 4-polytope is the tangency graph of an Apollonian 3-ball packing if and only if there is no six 4-cliques sharing a 3-clique. For higher dimension, we have some partial results. Keywords Apollonian ball packing · Stacked polytope · k-Tree · Forbidden subgraph Mathematics Subject Classification 52C17 · 52B11 · 20F55 1 Introduction A ball packing is a collection of balls with disjoint interiors. A graph is said to be ball packable if it can be realized by the tangency relations of a ball packing. The combi- natorics of disk packings (2-dimensional ball packings) is well understood thanks to the Koebe–Andreev–Thurston’s disk packing theorem, which asserts that every pla- Editor in Charge: János Pach The work was done when the author was a PhD candidate at Institut für Mathematik of Freie Universität Berlin. An alternative version of the manuscript appeared in the PhD thesis of the author. Hao Chen
[email protected] 1 Departement of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands 123 Discrete Comput Geom nar graph is disk packable.