On cycles through two arcs in strong multipartite tournaments

Details On cycles through two arcs in strong multipartite tournaments On cycles through two arcs in strong multipartite tournaments

2010-06-04

arxiv.org/abs/1006.0902v1

Computer Science

Discrete Mathematics

Scientific paper

A multipartite tournament is an orientation of a complete $c$-partite graph. In [L. Volkmann, A remark on cycles through an arc in strongly connected multipartite tournaments, Appl. Math. Lett. 20 (2007) 1148--1150], Volkmann proved that a strongly connected $c$-partite tournament with $c \ge 3$ contains an arc that belongs to a directed cycle of length $m$ for every $m \in \{3, 4, \ldots, c\}$. He also conjectured the existence of three arcs with this property. In this note, we prove the existence of two such arcs.

Affiliated with

Also associated with

No associations

Rating

On cycles through two arcs in strong multipartite tournaments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On cycles through two arcs in strong multipartite tournaments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On cycles through two arcs in strong multipartite tournaments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-723014