Number of the records: 1
Packing degenerate graphs
- 1.0507738 - MÚ 2020 RIV US eng J - Journal Article
Allen, P. - Böttcher, J. - Hladký, Jan - Piguet, Diana
Packing degenerate graphs.
Advances in Mathematics. Roč. 354, 1 October (2019), č. článku 106739. ISSN 0001-8708. E-ISSN 1090-2082
R&D Projects: GA ČR GJ16-07822Y
Institutional support: RVO:67985840 ; RVO:67985807
Keywords : extremal graph theory * graph packing * Tree packing conjecture
OECD category: Pure mathematics; Pure mathematics (UIVT-O)
Impact factor: 1.494, year: 2019
Method of publishing: Open access
http://dx.doi.org/10.1016/j.aim.2019.106739
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.
Permanent Link: http://hdl.handle.net/11104/0298714
File Download Size Commentary Version Access 0507738-arxiv.pdf 1 645.1 KB Author´s preprint open-access Hladky.pdf 24 988.4 KB Publisher’s postprint open-access
Number of the records: 1