A. Pyatkin

activity

20082022

most citedOn k-11-representable graphs

2 citations · 3 across the 9 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2022

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…

math.CO2021

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 $u_{1} \to u_{2} \to \dots \to u_{t}$ , $t \geq 2$ , either there is no ed…

math.CO2020

On semi-transitive orientability of triangle-free graphs

Sergey Kitaev, Artem Pyatkin

An orientation of a graph is semi-transitive if it is acyclic, and for any directed path $v_{0} \to v_{1} \to \dots \to v_{k}$ either there is no arc between $v_{0}$ …

math.CO2018★ 2 cited

On k-11-representable graphs

Gi-Sang Cheon, Jinha Kim, Minki Kim +2

Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word of the form $x y x y \dots$ (of even or…

math.CO2016

On the representation number of a crown graph

Marc Glen, Sergey Kitaev, Artem Pyatkin

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 $x y$ is an edge in $E$ . It is…

math.CO2015

Semi-Transitive Orientations and Word-Representable Graphs

Magnús M. Halldórsson, Sergey Kitaev, Artem Pyatkin

A graph $G = (V, E)$ is a \emph{word-representable graph} if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x, y) \in E$ f…