加入
Leech trees beyond six vertices
Find an edge-weighted tree on more than six vertices whose pairwise path lengths are exactly 1, 2, …, n(n−1)/2, or prove that none exists.
Update from the catalog #1
已合并
Find an edge-weighted tree on more than six vertices whose pairwise path lengths are exactly 1, 2, …, n(n−1)/2, or prove that none exists.