{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:58:08Z","timestamp":1787507888260,"version":"build-2736575974"},"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 any positive real number $\\gamma$ and any positive integer $h$, there is $N_0$ such that the following holds. Let $N\\ge N_0$ be such that $N$ is divisible by $h$. If $G$ is a tripartite graph with $N$ vertices in each vertex class such that every vertex is adjacent to at least $(2\/3+ \\gamma) N$ vertices in each of the other classes, then $G$ can be tiled perfectly by copies of $K_{h,h,h}$.  This extends the work in [Discrete Math. 254 (2002), 289\u2013308] and also gives a sufficient condition for tiling by any fixed 3-colorable graph. Furthermore, we show that the minimum-degree $(2\/3+ \\gamma) N$ in our result cannot be replaced by $2N\/3+ h-2$.<\/jats:p>","DOI":"10.37236\/198","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:25:27Z","timestamp":1578698727000},"source":"Crossref","is-referenced-by-count":5,"title":["Tiling Tripartite Graphs with $3$-Colorable Graphs"],"prefix":"10.37236","volume":"16","author":[{"given":"Ryan","family":"Martin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yi","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2009,8,31]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r109\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r109\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:41:09Z","timestamp":1579297269000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v16i1r109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,31]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2009,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/198","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,31]]},"article-number":"R109"}}