Extremal digraphs avoiding an orientation of $C_4$
Combinatorics
2018-02-13 v1
Abstract
Let be the orientation of which consists of two 2-paths with the same initial and terminal vertices. In this paper, we determine the maximum size of -free digraphs of order as well as the extremal digraphs attaining the maximum size when .
Cite
@article{arxiv.1802.03431,
title = {Extremal digraphs avoiding an orientation of $C_4$},
author = {Zejun Huang and Zhenhua Lyu},
journal= {arXiv preprint arXiv:1802.03431},
year = {2018}
}
Comments
22 pages,12 figures