Problem packetWorkR343
[#R343] Push the diameter ladder from five to six
1Summary
Settle the diameter-six families that Superdock's construction leaves open, using the diameter-five proof as the base case.
The most concrete open route. Diameter five is proved, and a class of diameter-six trees is proved, so the remaining target is a described finite family of shapes. The work is case analysis on the structure hanging off the central path.
Before starting: read the published diameter-six class and check which shapes it already covers. The exhaustive sweep in this project can serve as a regression test, since it can enumerate the diameter-six trees at small sizes and confirm any proposed construction against them.
Conjectured evidence. Replay readiness: source only.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: arxiv.org ↗, Superdock, arXiv:1403.1564
3How it connects
Attempts
- problem
Uses
- claim
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R343",
"content_hash": null,
"slug": "gtc-attempt-diameter-ladder",
"type": "attempt",
"title": "Push the diameter ladder from five to six",
"summary": "Settle the diameter-six families that Superdock's construction leaves open, using the diameter-five proof as the base case.",
"relevance": "For Graceful tree conjecture, record gtc-attempt-diameter-ladder (“Push the diameter ladder from five to six”) documents a concrete method, search boundary, or failed route. The record states: Settle the diameter-six families that Superdock's construction leaves open, using the diameter-five proof as the base case.",
"relevance_source": "recorded",
"body": "The most concrete open route. Diameter five is proved, and a class of diameter-six trees is proved, so the remaining target is a described finite family of shapes. The work is case analysis on the structure hanging off the central path.\n\nBefore starting: read the published diameter-six class and check which shapes it already covers. The exhaustive sweep in this project can serve as a regression test, since it can enumerate the diameter-six trees at small sizes and confirm any proposed construction against them.",
"status": "open_strategy",
"evidence_grade": "proposed",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://arxiv.org/abs/1403.1564",
"locator": "Superdock, arXiv:1403.1564"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://arxiv.org/abs/1403.1564",
"locator": "Superdock, arXiv:1403.1564"
},
"models": [],
"relations": [
{
"slug": "gtc-problem-diameter-six",
"title": "Gracefulness of diameter-six trees",
"object_type": "problem",
"relation": "attempts",
"direction": "outgoing"
},
{
"slug": "R350",
"title": "Trees of diameter at most five are graceful",
"object_type": "claim",
"relation": "uses",
"direction": "outgoing"
},
{
"slug": "graceful-tree-conjecture",
"title": "graceful tree conjecture",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- graceful-tree-conjecture
- Locator
- Superdock, arXiv:1403.1564
- License
- CC-BY-4.0
- Contributors
- Philip Weiss, TheoremDB graceful-tree reproduction
- Source
- arxiv.org ↗
- Public record
- R343
- Stable alias
- gtc-attempt-diameter-ladder
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.