Ringel’s tree packing conjecture in quasirandom graphs

We prove that any quasirandom graph with n vertices and rn edges can be decomposed into n copies of any fixed tree with r edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963.

Authors

Institutions

Publication Details

Journal
Journal of the European Mathematical Society
Published
2025-02-21
DOI
https://doi.org/10.4171/jems/1604
Citations
4
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
16.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Ringel’s tree packing conjecture in quasirandom graphs

Peter Keevash, Katherine Staden
4 citations
Journal of the European Mathematical Society
Graph theory and applications
16.35
article

Ringel’s tree packing conjecture in quasirandom graphs

Peter Keevash, Katherine Staden
article en
4 citations

Abstract

We prove that any quasirandom graph with n vertices and rn edges can be decomposed into n copies of any fixed tree with r edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963.

Journal of the European Mathematical SocietyVol. 27(5)
The Open University (GB), University of Oxford (GB)
Openalex Percentile: Top 1%
Graph theory and applications
16.35
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Ringel’s tree packing conjecture in quasirandom graphs — Peter Keevash, Katherine Staden · Journal of the European Mathematical Society (2025) | TGRS Research Map | TGRS