arXiv (All)
open access
Nonexistence of a Leech Tree of Order 18: A Computer-Assisted Proof
A Leech tree of order $n$ is a tree with positive integral edge weights whose $n(n-1)/2$ pairwise weighted distances are precisely $1,2,\ldots,n(n-1)/2$. This paper gives a computer-assisted proof that no Leech tree of order $18$ exists. The argument has three layers. First, a development in Lean 4
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- There is no Leech tree on 18 vertices, and no Leech spider of order at least five, with a leaf-deletion bound at order 25#664943
- Multicolor Ramsey and list Ramsey numbers for star-like trees#973959
- Embedding rooted blow-ups of tree posets#1049282
- The interval posets of permutations seen from the decomposition tree perspective#156434
- The Burr-Erdős-Graham-Sós conjecture for the seven-cycle#1142887
Record · ID 1034308
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive