2016/02/29 by Gao, Alice L. L., Kitaev, Sergey, Zhang, Philip B.
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1602.08965
A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if xy is an edge in E. Word-representable graphs are the subject of a long research line in the literature initiated in \citeKP, and they are the main focus in the recently published book \citeKL. A word w=w1⋯ wn avoids the pattern 132 if there are no 1≤ i1