Number of the records: 1  

Packing degenerate graphs

  1. 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

    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:

    0507738-arxiv.pdf1645.1 KBAuthor´s preprintopen-access
    Hladky.pdf24988.4 KBPublisher’s postprintopen-access
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.