Extremal digraphs avoiding an orientation of C₄

2018/02/09 by Zejun Huang, Zhenhua Lyu, Huang, Zejun +1 · 2 citations
Mathematics · Computer Science · #Graph theory and applications #Advanced Graph Theory Research #Finite Group Theory Research

paper · pdf · doi:10.48550/arxiv.1802.03431

Abstract

Let P_2,2 be the orientation of C₄ 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≥ 13.

Cited by

• New constructions and bounds for nonabelian Sidon sets with applications to Turán-type problems
• 0-1 matrices with zero trace whose squares are 0-1 matrices

Related

• Extremal digraphs containing at most t paths of length 2 with the same endpoints
• Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
• The Turan problems of directed paths and cycles in digraphs
• A note on extremal digraphs containing at most t walks of length k with the same endpoints
• Digraphs with a fixed number of edges and vertices, having a maximal number of walks of length 2