# A proof of the Kotzig-Ringel-Rosa Conjecture

Source: [A proof of the Kotzig-Ringel-Rosa Conjecture](<https://www.sota2.com/research/paper/68fa5ce71e209131ce9d5314>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T17:55:19.230Z

Authors: Edinah K. Gnang

Published: 2022-02-04T12:04:18.000Z

## Abstract

In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with a subset of the integers ranging from 0 to m inclusive, such that no two vertices share a label, and each edge is uniquely identified by the absolute difference of labels assigned to its endpoints. The Kotzig-Ringel-Rosa conjecture asserts that every tree admits a graceful labeling. We provide a proof of this long standing conjecture via a functional reformulation of the conjecture and a composition lemma.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2202.03178>)

[PDF](<https://arxiv.org/pdf/2202.03178.pdf>)
