| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777053 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
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))(n2), then G packs into the complete graph Kn.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet,