Given a metric space *(M,d)* define the packing function *P(x,R,r)* to be the maximum number of non-intersecting balls of radius *r* with centers in the ball *B(x,R)*. Let’s call *M* packing-homogeneous if the packing function is independent of the base point *x*.

**Conjecture** A complete connected packing-homogeneous space *M* is homogeneous. That is, the group of isometries acts transitively on *M*.

Completeness is necessary as Ricky Demer pointed out.

Connectedness is necessary. It is not difficult to construct finite graphs that are packing-homogeneous, but are not homogeneous (vertex-transitive).

**Remark 1** It follows from the work of Gleason, Montgomery, Zippin and others on Hilbert’s 5th problem that a complete connected finite-dimensional homogeneous space is a manifold. Thus, a complete connected finite-dimensional packing-homogeneous space that is not a manifold (for example, has fractional Hausdorff dimension) would provide a counter-example to the conjecture.

**Remark 2** I hoped to settle this question for length spaces (or inner metric spaces), i.e. when the distance between two points is equal to the length of a shortest path. Every length space is a Gromov-Hausdorff limit of grpahs. I was hoping to establish a connection between some "almost packing-homogeneous" and "almost homogeneous" properties of graphs that in the limit would give me the desired result (in the spirit of what Gromov does in his paper on groups of polynomial growth). Or, to prove the opposite, constructing a convergent sequence of graphs that is "almost packing-homogeneous" but "increasingly inhomogeneous". After some attempts I thought that the problem for graphs may be as difficult as the original conjecture.

**Remark 3** As far as I know, the conjecture is open even for Riemannian manifolds of dimension greater than 2.

I was not able to find any papers that would mention this question or try to attack it. How plausible is it that the conjecture is true? Where one would look for counterexamples?

I would also be grateful for any comments that would put this problem in a broader context, or any guesses as to how difficult this problem might be.