TheoremDB

Problem packetWorkR349

R349claimStatus: establishedEvidence: SupportedReplay: source only

[#R349] A graceful tree decomposes the complete graph

claim. A graceful labeling of a tree with \(m\) edges gives a cyclic decomposition of \(K_{2m+1}\) into \(2m+1\) copies of that tree.

View evidenceOpen source ↗

1Summary

Rosa's original motivation. Label the vertices of \(K_{2m+1}\) by \(\mathbb{Z}_{2m+1}\) and embed the tree using the graceful labels; the \(2m+1\) rotations of that copy use every edge of \(K_{2m+1}\) exactly once. This is why the conjecture matters outside labeling theory, and it is the reason a proof has to produce labelings, since the decomposition is built out of them.

Supported evidence. Recorded scope: every tree carrying a graceful labeling.

2Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: www.combinatorics.org ↗, Gallian, Dynamic Survey of Graph Labeling, introduction

3How it connects

Informs

Recorded for

4Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R349",
  "content_hash": null,
  "slug": "gtc-claim-decomposition-motivation",
  "type": "claim",
  "title": "A graceful tree decomposes the complete graph",
  "summary": "A graceful labeling of a tree with \\(m\\) edges gives a cyclic decomposition of \\(K_{2m+1}\\) into \\(2m+1\\) copies of that tree.",
  "relevance": "For Graceful tree conjecture, record gtc-claim-decomposition-motivation (“A graceful tree decomposes the complete graph”) records a bound, answer, status fact, or structural consequence. The record states: A graceful labeling of a tree with \\(m\\) edges gives a cyclic decomposition of \\(K_{2m+1}\\) into \\(2m+1\\) copies of that tree.",
  "relevance_source": "recorded",
  "body": "Rosa's original motivation. Label the vertices of \\(K_{2m+1}\\) by \\(\\mathbb{Z}_{2m+1}\\) and embed the tree using the graceful labels; the \\(2m+1\\) rotations of that copy use every edge of \\(K_{2m+1}\\) exactly once. This is why the conjecture matters outside labeling theory, and it is the reason a proof has to produce labelings, since the decomposition is built out of them.",
  "status": "established",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "universal",
    "statement": "every tree carrying a graceful labeling"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6",
      "locator": "Gallian, Dynamic Survey of Graph Labeling, introduction"
    },
    "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, introduction"
  },
  "models": [],
  "relations": [
    {
      "slug": "graceful-tree-conjecture",
      "title": "Graceful tree conjecture",
      "object_type": "problem",
      "relation": "informs",
      "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
Gallian, Dynamic Survey of Graph Labeling, introduction
License
CC-BY-4.0
Contributors
Philip Weiss, TheoremDB graceful-tree reproduction
Public record
R349
Stable alias
gtc-claim-decomposition-motivation
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.