{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:37Z","timestamp":1753893817293,"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>We say that a graph $G$ has a perfect $H$-packing if there exists a set of vertex-disjoint copies of $H$ which cover all the vertices in $G$. We consider various problems concerning perfect $H$-packings: Given $n, r , D \\in \\mathbb N$, we characterise the edge density threshold that ensures a perfect $K_r$-packing in any graph $G$ on $n$ vertices and with minimum degree $\\delta (G) \\geq D$. We also give two conjectures concerning degree sequence conditions which force a graph to contain a perfect $H$-packing. Other related embedding problems are also considered. Indeed, we give a structural result concerning $K_r$-free graphs that satisfy a certain degree sequence condition.<\/jats:p>","DOI":"10.37236\/3173","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:57:09Z","timestamp":1578711429000},"source":"Crossref","is-referenced-by-count":10,"title":["On Perfect Packings in Dense Graphs"],"prefix":"10.37236","volume":"20","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandr","family":"Kostochka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Treglown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2013,3,8]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p57\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p57\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:25:25Z","timestamp":1579260325000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i1p57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,8]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/3173","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,3,8]]},"article-number":"P57"}}