• 대한수학회지
• /
• 제36권2호
• /
• pp.431-445
• /
• 1999

A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of in-neighbors of x induce tournaments. Let x and y be two vertices of a 3-connected and arc-3-cyclic local tournament T with y x. We investigate the structure of T such that T contains no (x,y)-path of length k for some k with 3 k V(T) -1. Our result generalized those of [2] and [5] for tournaments.