3 problems

Let the perimeter gap of a digraph be the difference between its number of vertices and the length of its longest directed cycle. Bucić–Hendrey–Mohar–Steiner–Yepremyan's conjecture…

Let $c(n)$ be the minimum circumference of a connected vertex-transitive graph on $n$ vertices, and let $d(n)$ be the minimum circumference of a connected vertex-transitive digraph…

For a directed graph, its circumference is the maximum length of a directed cycle, and its perimeter gap is the difference between its order and its circumference. Linear perimeter…