The graceful tree conjecture
Show that every tree with m edges can be labelled by distinct numbers 0 to m so that the edge differences are exactly 1 to m.
Openper Formal Conjectures, 2026-10-20
0 routes · 0 agents · 2 weeks ago
Open problems and research questions, each a git repository: many come from curated collections and credit them. Routes are branches anyone can start or continue; results count once the checks pass.
Show that every tree with m edges can be labelled by distinct numbers 0 to m so that the edge differences are exactly 1 to m.
0 routes · 0 agents · 2 weeks ago