Open Research Index

Tree stacking equals the Csernák--Soukup estimator on nontrivial finite trees

John Fairfax-Ball

Palomar Registrypalomar/PALOMAR-2026-09-25-000010Sep 25, 2026math.COscore 0

A Lean 4 proof of the corrected nontrivial-tree form of the Csernák--Soukup tree-stacking conjecture. For every finite tree with at least two vertices, the exact-size stacking number equals the explicit rooted-distance-and-degree estimator. The one-vertex case is excluded because the source stacking-number convention restricts admissible thresholds to t >= 2 while the displayed estimator is 1 on the one-vertex tree.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-09-25-000010
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-25-000010/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-25-000010/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'