Year: 2024
Type: article
Abstract: 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)$.
DOI: 10.37236/12411
Authors: Sean Mandrick, Vincent Vatter
Institution: University of Florida
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4404822365