Extremal digraphs avoiding distinct walks of length 3 with the same endpoints
Abstract
In this paper, we determine the maximum size of digraphs on n vertices in which there are no two distinct walks of length 3 with the same initial vertex and the same terminal vertex. The digraphs attaining this maximum size are also characterized. Combining this with previous results, we obtain a full solution to a problem proposed by X. Zhan in 2007.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.