@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 — 默认分支还没有路线
issues

Board: Leech trees beyond six vertices

Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.

0 open issues, 0 that nobody works on, 0 worked on; 0 open pull requests.

main at 5320f63: no checks on it yet.