Minimal fillings possess exact tours

Let M=(M,ρ){\cal M}=(M,\rho) be a finite pseudo-metric space and let G{\cal G} be a minimal filling of M{\cal M}. An exact tour is a tour whose associated boundary paths realize the corresponding distances and whose total length equals the weight of G{\cal G}.

Exact-tour conjecture. Every minimal filling possesses an exact tour.

Exact tours would provide a direct combinatorial certificate for the weight of a minimal filling and are used in the paper to relate minimal fillings to parametric fillings and tour lengths. The supplied passage gives an example of an unstable minimal parametric filling that nevertheless possesses an exact tour, but does not establish the conjecture in general.

Sources & referencesView supporting material

Primary source

A. O. Ivanov and A. A. Tuzhilin, “One-dimensional Gromov minimal filling”, arXiv:1101.0106 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.