Packing degenerate graphs

Allen, Peter

; Hladký, Jan; and Piguet, Diana (2019) Packing degenerate graphs Advances in Mathematics, 354: 106739. ISSN 0001-8708

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
Keywords	graph packing,randomised algorithm,UKRI fund
Departments	Mathematics
DOI	10.1016/j.aim.2019.106739
Date Deposited	17 Jul 2019 10:30
URI	https://researchonline.lse.ac.uk/id/eprint/101176

Explore Further

QA Mathematics

http://www.lse.ac.uk/Mathematics/people/Peter-Allen (Author)
http://www.lse.ac.uk/Mathematics/people/Julia-Boettcher (Author)

picture_as_pdf

picture_as_pdf
subject: Published Version
: Available under Creative Commons: Attribution 4.0

Download

Atom

BibTeX

OpenURL ContextObject in Span

OpenURL ContextObject

Dublin Core

MPEG-21 DIDL

Data Cite XML

EndNote

HTML Citation

METS

MODS

RIOXX2 XML

Reference Manager

Refer

ASCII Citation

Export

Downloads