Allen, Peter ORCID: 0000-0001-6555-3501, Böttcher, Julia
ORCID: 0000-0002-4104-3635, Hladký, Jan and Piguet, Diana
(2019)
Packing degenerate graphs.
Advances in Mathematics, 354.
ISSN 0001-8708
![]() |
Text (Packing degenerate graphs)
- Published Version
Available under License Creative Commons Attribution. Download (988kB) |
Identification Number: 10.1016/j.aim.2019.106739
Abstract
Given D and γ>0, whenever c>0 is sufficiently small and n sufficiently large, if G is a family of D-degenerate graphs of individual orders at most n, maximum degrees at most cnlogn, and total number of edges at most (1−γ)(n2), then G packs into the complete graph Kn. Our proof proceeds by analysing a natural random greedy packing algorithm.
Item Type: | Article |
---|---|
Additional Information: | © 2019 The Authors |
Divisions: | Mathematics |
Subjects: | Q Science > QA Mathematics |
Date Deposited: | 17 Jul 2019 10:30 |
Last Modified: | 31 Jul 2024 15:03 |
URI: | http://eprints.lse.ac.uk/id/eprint/101176 |
Actions (login required)
![]() |
View Item |