English

Extremal digraphs avoiding an orientation of $C_4$

Combinatorics 2018-02-13 v1

Abstract

Let P2,2P_{2,2} be the orientation of C4C_4 which consists of two 2-paths with the same initial and terminal vertices. In this paper, we determine the maximum size of P2,2P_{2,2}-free digraphs of order nn as well as the extremal digraphs attaining the maximum size when n13n\ge 13.

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

R2 v1 2026-06-23T00:17:30.641Z