Allen, Peter, Böttcher, Julia, Clemens, Dennis and Taraz, Anusch (2022) Perfectly packing graphs with bounded degeneracy and many leaves. Israel Journal of Mathematics. ISSN 0021-2172
![[img]](http://eprintstest.lse.ac.uk/style/images/fileicons/text.png) |
Text (Perfectly packing graphs with bounded degeneracy and many leaves)
- Accepted Version
Download (787kB) |
Identification Number: https://doi.org/10.1007/s11856-022-2447-7
Abstract
We prove that one can perfectly pack degenerate graphs into complete or dense n-vertex quasirandom graphs, provided that all the degenerate graphs have maximum degree(Formula Presented.)., and in addition Ω(n) of them have at most (1 − Ω(1))n vertices and Ω(n) leaves. This proves Ringel’s conjecture and the Gyárfás Tree Packing Conjecture for all but an exponentially small fraction of trees (or sequences of trees, respectively).
| Item Type: | Article |
|---|---|
| Official URL: | https://www.springer.com/journal/11856 |
| Additional Information: | © 2021 Springer Nature Switzerland AG |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 11 May 2021 10:48 |
| Last Modified: | 20 Sep 2025 02:01 |
| URI: | http://eprintstest.lse.ac.uk/id/eprint/110429 |
Actions (login required)
 |
View Item |
