{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:41Z","timestamp":1753893821376,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>For every fixed graph $H$, we determine the $H$-packing number of $K_n$, for all $n &gt; n_0(H)$. We prove that if $h$ is the number of edges of $H$, and $gcd(H)=d$ is the greatest common divisor of the degrees of $H$, then there  exists $n_0=n_0(H)$, such that for all $n &gt; n_0$, $$ P(H,K_n)=\\lfloor {{dn}\\over{2h}} \\lfloor {{n-1}\\over{d}} \\rfloor \\rfloor, $$ unless $n = 1 \\bmod d$ and $n(n-1)\/d = b \\bmod (2h\/d)$ where $1 \\leq b \\leq d$, in which case $$ P(H,K_n)=\\lfloor {{dn}\\over{2h}} \\lfloor {{n-1}\\over{d}} \\rfloor \\rfloor - 1. $$ Our main tool in proving this result is the deep decomposition result of Gustavsson.<\/jats:p>","DOI":"10.37236\/1286","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:54:19Z","timestamp":1578707659000},"source":"Crossref","is-referenced-by-count":10,"title":["Packing Graphs: The Packing Problem Solved"],"prefix":"10.37236","volume":"4","author":[{"given":"Yair","family":"Caro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[1996,12,2]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v4i1r1\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v4i1r1\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T06:14:51Z","timestamp":1579328091000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v4i1r1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12,2]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[1997,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1286","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[1996,12,2]]},"article-number":"R1"}}