Library Header Image
LSE Research Online LSE Library Services

Packing degenerate graphs

Allen, Peter, Böttcher, Julia, Hladký, Jan and Piguet, Diana (2019) Packing degenerate graphs. Advances in Mathematics. ISSN 0001-8708 (In Press)

[img] Text (Packing degenerate graphs) - Accepted Version
Pending embargo until 1 January 2100.

Download (806kB) | Request a copy


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 Elsevier Inc.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 17 Jul 2019 10:30
Last Modified: 17 Aug 2019 23:10

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics