Forbidden patterns of graphs 12-representable by pattern-avoiding words

Asahi Takaoka

A graph $G=(\{1,2,\dots ,n\},E)$ is $12$-representable if there is a word $w$ over $\{1,2,\dots ,n\}$ such that two vertices $i$ and $j$ with $i<j$ are adjacent if and o…