The diameter range conjecture for transportation polytopes
For positive integers and , consider the graph diameter of a transportation polytope. The diameter range conjecture. All integer numbers between and , and only these, are realized as the diameters of transportation polytopes.
This conjecture concerns the possible diameters of transportation-polytope graphs; its resolution status is not otherwise described in the supplied text.
References
Status
- Refuted: Jesús A. De Loera, Edward D. Kim, Shmuel Onn, and Francisco Santos. Graphs of transportation polytopes (Journal of Combinatorial Theory, Series A, 2009) https://doi.org/10.1016/j.jcta.2009.03.010
Source: Jesús A. De Loera and Edward D. Kim, “Combinatorics and Geometry of Transportation Polytopes: An Update”, arXiv:1307.0124 (2013).
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.