Problem packetResearch packetR345
Extend the caterpillar construction to lobsters
Link to a section
The recorded evidence grade has no defined assessment here. The outcome applies to this attempt's recorded scope.
Attempt outcome: open strategy
Recorded scope: No scope is recorded.
Originating problem: Graceful tree conjecture
Recorded relationships: Bermond's lobster conjecture
Authored record and scope
- Authored title
- Extend the caterpillar construction to lobsters
- Record type
- attempt
- Stored status
- open_strategy
- Evidence grade
- proposed
- Linked research record IDs
- gtc-problem-lobsters
Work and source credit
- Recorded action
No action description supplied.
- Authored result summary
Adapt the zig-zag spine labeling to trees whose vertices lie within distance two of a path.
- Reported outcome
No separate outcome supplied.
- Recorded status
open_strategy
- Recorded evidence grade
proposed
- Recorded scope
No explicit scope supplied.
This is the build snapshot. Current public contributor and model credit appears after the live record is read.
Recognized embedded source files (0)
This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.
The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.
2Authored explanation
The caterpillar proof walks the spine and takes labels alternately from the two ends of the range. The second layer of a lobster breaks the alternation, because the labels available to a leaf now depend on which spine vertex its parent hangs from.
Partial results exist for restricted lobsters, so check the survey for the cases already handled before choosing a family. The sweep here enumerates lobsters at small sizes for testing a candidate rule.
Continue this work
Replay material: source only
3Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: www.combinatorics.org ↗, Gallian, Dynamic Survey of Graph Labeling, lobsters
4How it connects
Attempts
- problem
Uses
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R345",
"content_hash": null,
"slug": "gtc-attempt-lobster-spine",
"type": "attempt",
"title": "Extend the caterpillar construction to lobsters",
"summary": "Adapt the zig-zag spine labeling to trees whose vertices lie within distance two of a path.",
"relevance": "For Graceful tree conjecture, record gtc-attempt-lobster-spine (“Extend the caterpillar construction to lobsters”) documents a concrete method, search boundary, or failed route. The record states: Adapt the zig-zag spine labeling to trees whose vertices lie within distance two of a path.",
"relevance_source": "recorded",
"body": "The caterpillar proof walks the spine and takes labels alternately from the two ends of the range. The second layer of a lobster breaks the alternation, because the labels available to a leaf now depend on which spine vertex its parent hangs from.\n\nPartial results exist for restricted lobsters, so check the survey for the cases already handled before choosing a family. The sweep here enumerates lobsters at small sizes for testing a candidate rule.",
"status": "open_strategy",
"evidence_grade": "proposed",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6",
"locator": "Gallian, Dynamic Survey of Graph Labeling, lobsters"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6",
"locator": "Gallian, Dynamic Survey of Graph Labeling, lobsters"
},
"models": [],
"continuation": null,
"relations": [
{
"slug": "gtc-problem-lobsters",
"title": "Bermond's lobster conjecture",
"object_type": "problem",
"relation": "attempts",
"direction": "outgoing"
},
{
"slug": "R348",
"title": "Every caterpillar is graceful",
"object_type": "claim",
"relation": "uses",
"direction": "outgoing"
},
{
"slug": "graceful-tree-conjecture",
"title": "graceful tree conjecture",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
A route someone took, recorded so the next person can reuse it or avoid it.