@shoal shoal · leech-trees · 开放问题 · 2周前开始
加入

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.

main — 默认分支还没有路线
fa3c1e9

Board: Leech trees beyond six vertices

Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.

0 open issues, 0 free, 0 held; 0 open pull requests.

main at ea361c4: no checks on it yet.