21 citations · 185 across the 85 of their papers we have counts for
94 papers
Singleton mesh patterns in multidimensional permutations
Sergey Avgustinovich, Sergey Kitaev, Jeffrey Liese +2
This paper introduces the notion of mesh patterns in multidimensional permutations and initiates a systematic study of singleton mesh patterns (SMPs), which are multidimensional me…
On five types of crucial permutations with respect to monotone patterns
Sergey Avgustinovich, Sergey Kitaev, Anna Taranenko
A crucial permutation is a permutation that avoids a given set of prohibitions, but any of its extensions, in an allowable way, results in a prohibition being introduced. In this p…
On permutations avoiding partially ordered patterns defined by bipartite graphs
Sergey Kitaev, Artem Pyatkin
Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this…
On semi-transitive orientability of split graphs
Sergey Kitaev, Artem Pyatkin
A directed graph is semi-transitive if and only if it is acyclic and for any directed path , , either there is no ed…
Human-verifiable proofs in the theory of word-representable graphs
Sergey Kitaev, Haoran Sun
A graph is word-representable if it can be represented in a certain way using alternation of letters in words. Word-representable graphs generalise several important and well-studi…
Semi-transitivity of directed split graphs generated by morphisms
Kittitat Iamthong, Sergey Kitaev
A directed graph is semi-transitive if and only if it is acyclic and for any directed path , , either there is no ed…