A proof of Ringel’s conjecture
OPEN ACCESS
Loading...
Author / Producer
Date
2021-06
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
A typical decomposition question asks whether the edges of some graph G can be partitioned into disjoint copies of another graph H. One of the oldest and best known conjectures in this area, posed by Ringel in 1963, concerns the decomposition of complete graphs into edge-disjoint copies of a tree. It says that any tree with n edges packs 2n + 1 times into the complete graph K2n+1. In this paper, we prove this conjecture for large n.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
31 (3)
Pages / Article No.
663 - 720
Publisher
Springer
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
03993 - Sudakov, Benjamin / Sudakov, Benjamin
Notes
Funding
196965 - Problems in Extremal and Probabilistic Combinatorics (SNF)