Extremal digraphs avoiding an orientation of C₄
classification
🧮 math.CO
keywords
digraphsextremalmaximumorientationsizeattainingavoidingconsists
read the original abstract
Let $P_{2,2}$ be the orientation of $C_4$ which consists of two 2-paths with the same initial and terminal vertices. In this paper, we determine the maximum size of $P_{2,2}$-free digraphs of order $n$ as well as the extremal digraphs attaining the maximum size when $n\ge 13$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.