Word-Representability of Shift Graphs
Suchanda Roy, Ramesh Hariharasubramanian

TL;DR
This paper proves that shift graphs, a class of sparse graphs with high chromatic number, are word-representable, and introduces generalized shift graphs with similar properties, highlighting differences between line graphs and line digraphs.
Contribution
The paper establishes that all shift graphs and their natural generalizations are word-representable, expanding understanding of word-representability in complex graph classes.
Findings
Shift graphs are word-representable.
Generalized shift graphs are also word-representable.
Line digraphs of certain word-representable graphs remain word-representable.
Abstract
A graph is word-representable if there exists a word over the alphabet such that letters and alternate in if and only if . For integers , the shift graph is the graph whose vertex set consists of all increasing -tuples with , where two vertices and are adjacent whenever for all or for all . Shift graphs are classical examples of sparse graphs having arbitrarily high chromatic number and odd girth. We further observe that shift graphs arise naturally as induced subgraphs of simplified de Bruijn graphs. Although simplified de Bruijn graphs contain non-word-representable members in general, we prove that the entire class of shift graphs is word-representable. We also introduce a natural…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
