Počet záznamů: 1
Packing Degenerate Graphs Greedily
- 1.0477019 - ÚI 2018 RIV NL eng J - Článek v odborném periodiku
Allen, P. - Böttcher, J. - Hladký, J. - Piguet, Diana
Packing Degenerate Graphs Greedily.
Electronic Notes in Discrete Mathematics. Roč. 61, August (2017), s. 45-51. ISSN 1571-0653
Grant CEP: GA ČR GJ16-07822Y
Institucionální podpora: RVO:67985807
Klíčová slova: tree packing conjecture * graph packing * graph processes
Obor OECD: Pure mathematics
We prove that if G is a family of graphs with at most n vertices each, with constant degeneracy, with maximum degree at most O(n/log n), and with total number of edges at most (1-o(1)) n^2/2, then G packs into the complete graph on n vertices.
Trvalý link: http://hdl.handle.net/11104/0273424
Počet záznamů: 1