Abstract
We define the occurrence graph of a pattern in a permutation as the graph whose vertices are the occurrences of in , with edges between the vertices if the occurrences differ by exactly one element. We then study properties of these graphs. The main theorem in this paper is that every hereditary property of graphs gives rise to a permutation class.
Citation
Bjarni Jens Kristinsson. Henning Ulfarsson. "Occurrence graphs of patterns in permutations." Involve 12 (6) 901 - 918, 2019. https://doi.org/10.2140/involve.2019.12.901
Information