Extremal Digraphs Avoiding Distinct Walks of Length 4 with the Same Endpoints

Abstract

Let n ≥ 8 be an integer. We characterize the extremal digraphs of order n with the maximum number of arcs avoiding distinct walks of length 4 with the same endpoints.

Keywords

• digraph
• turán problems
• transitive tournament
• walk
• 05c20
• 05c35