{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:32Z","timestamp":1753893812072,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Lettericity measures the minimum size of an alphabet needed to represent a graph as a letter graph, where vertices are encoded by letters, and edges are determined by an underlying decoder. We prove that all graphs on $n$ vertices have lettericity at most approximately $n - \\tfrac{1}{2} \\log_2 n$ and that almost all graphs on $n$ vertices have lettericity at least $n - (2 \\log_2 n + 2 \\log_2 \\log_2 n)$.<\/jats:p>","DOI":"10.37236\/12411","type":"journal-article","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T12:33:03Z","timestamp":1732797183000},"source":"Crossref","is-referenced-by-count":0,"title":["Bounds on the Lettericity of Graphs"],"prefix":"10.37236","volume":"31","author":[{"given":"Sean","family":"Mandrick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Vatter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2024,11,29]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i4p53\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v31i4p53\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T12:33:03Z","timestamp":1732797183000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v31i4p53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,29]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,10,3]]}},"URL":"https:\/\/doi.org\/10.37236\/12411","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2024,11,29]]},"article-number":"P4.53"}}