A Lower Bound for Kruskal's Weak Tree Function tree(3)
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914283730763776 |
|---|---|
| author | Giroux, Mark |
| author_facet | Giroux, Mark |
| contents | We establish an explicit lower bound for Kruskal's weak tree function at n=3, proving that tree(3) >= 844,424,930,131,960 = 3 * 2^48 - 8. This is achieved by constructing an explicit sequence of unlabeled rooted trees satisfying the constraints of the weak tree function and carefully analyzing the combinatorics of the "leg elimination" process. Our bound significantly exceeds previous estimates and demonstrates that even for small arguments, the weak tree function exhibits rapid growth. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_19658 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A Lower Bound for Kruskal's Weak Tree Function tree(3) Giroux, Mark Combinatorics 05C05, 06A07, 03F30 F.2.2; G.2.1 We establish an explicit lower bound for Kruskal's weak tree function at n=3, proving that tree(3) >= 844,424,930,131,960 = 3 * 2^48 - 8. This is achieved by constructing an explicit sequence of unlabeled rooted trees satisfying the constraints of the weak tree function and carefully analyzing the combinatorics of the "leg elimination" process. Our bound significantly exceeds previous estimates and demonstrates that even for small arguments, the weak tree function exhibits rapid growth. |
| title | A Lower Bound for Kruskal's Weak Tree Function tree(3) |
| topic | Combinatorics 05C05, 06A07, 03F30 F.2.2; G.2.1 |
| url | https://arxiv.org/abs/2601.19658 |