Number of the records: 1

Packing degenerate graphs

SYSNO ASEP	0507738
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve WOS
Title	Packing degenerate graphs
Author(s)	Allen, P. (GB) Böttcher, J. (GB) Hladký, Jan (MU-W)_{RID, SAI, ORCID} Piguet, Diana (UIVT-O)_{RID, ORCID, SAI}
Article number	106739
Source Title	Advances in Mathematics. - : Elsevier - ISSN 0001-8708 Roč. 354, 1 October (2019)
Number of pages	58 s.
Language	eng - English
Country	US - United States
Keywords	extremal graph theory ; graph packing ; Tree packing conjecture
Subject RIV	BA - General Mathematics
OECD category	Pure mathematics
Subject RIV - cooperation	Institute of Computer Science - General Mathematics
R&D Projects	GJ16-07822Y GA ČR - Czech Science Foundation (CSF)
Method of publishing	Open access
Institutional support	MU-W - RVO:67985840 ; UIVT-O - RVO:67985807
UT WOS	000484644900016
EID SCOPUS	85072717465
DOI	10.1016/j.aim.2019.106739
Annotation	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.
Workplace	Mathematical Institute
Contact	Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
Year of Publishing	2020
Electronic address	http://dx.doi.org/10.1016/j.aim.2019.106739

Number of the records: 1