{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:06Z","timestamp":1753893846935,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The set of all doubled patterns on $n$ or fewer letters can be\u00a0avoided on an alphabet with $k$ letters, where $k$ is the least\u00a0even integer strictly greater than $n+1$, with the exception of $n=4$.\u00a0The set of all doubled patterns on $4$ or fewer letters can be\u00a0avoided on the $8$-letter alphabet. The set of all avoidable patterns\u00a0on $n$ or fewer letters can be avoided on an alphabet with $2(n+2)$\u00a0letters.<\/jats:p>","DOI":"10.37236\/7074","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:33:31Z","timestamp":1578670411000},"source":"Crossref","is-referenced-by-count":1,"title":["Some Variations on a Theme of Irina Mel'nichuk Concerning the Avoidability of Patterns in Strings of Symbols"],"prefix":"10.37236","volume":"25","author":[{"given":"George F.","family":"McNulty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2018,5,11]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p22\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p22\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:33:50Z","timestamp":1579235630000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i2p22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,11]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/7074","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,5,11]]},"article-number":"P2.22"}}