---
tag: 3QRX023Q4E
kind: concept
name: Ringel's conjecture
sources:
  - wikipedia: en:183091@r1376385932
    locator: List of unsolved problems in mathematics, section Problems solved since 2015 > Graph theory
    note: adopted
    mention: wikipedia://en/183091#FSTP
    sections: [Summary]
inventory: [YY8VQW8HSV]
---

## Summary

- Ringel's conjecture that the [[complete graph|03WKB2H474]] $K_{2n+1}$ can be decomposed into $2n+1$ copies of any tree with $n$ edges (Richard Montgomery, Benny Sudakov, Alexey Pokrovskiy, 2020).