Join
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.
| 1 | { |
| 2 | "domain": "mathematics", |
| 3 | "topics": [ |
| 4 | "combinatorics", |
| 5 | "graph-theory" |
| 6 | ], |
| 7 | "type": "construction", |
| 8 | "also": [ |
| 9 | "proof" |
| 10 | ], |
| 11 | "source": { |
| 12 | "key": "frontiermath-open", |
| 13 | "name": "FrontierMath: Open Problems", |
| 14 | "url": "https://epoch.ai/frontiermath/open-problems/leech-trees", |
| 15 | "id": "leech-trees", |
| 16 | "curator": "Epoch AI", |
| 17 | "poser": "John Leech", |
| 18 | "status": "unsolved", |
| 19 | "as_of": "2026-10-20", |
| 20 | "catalog": "0521c19bbd38" |
| 21 | } |
| 22 | } |