Alfaro's conjecture on shortest directed networks

Let AA be the set of sources and BB the set of sinks in the Euclidean plane. A shortest (A,B)(A,B)-network is a directed network of minimum length connecting the prescribed sources and sinks.

Alfaro's conjecture. If A=BA=B, then a shortest (A,B)(A,B)-network has no Steiner points and is a union of cycles.

This conjecture concerns the local and global structure of shortest directed networks when the source and sink sets coincide. It is presented as an attractive conjecture; no resolution is given here.

Sources & referencesView supporting material

Primary source

Alastair Maxwell and Konrad J. Swanepoel, “Shortest directed networks in the plane”, arXiv:1903.07172 (2020).

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.