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/logn), and with total number of edges at most (1−o(1))(n2), then G packs into the complete graph Kn.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
More From: Electronic Notes in Discrete Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
