Oriented paths in n-chromatic digraphs

Details Oriented paths in n-chromatic digraphs Oriented paths in n-chromatic digraphs

2011-12-07

arxiv.org/abs/1112.1545v1

Mathematics

Combinatorics

25 pages, Master thesis in Graph Theory at the Lebanese University

Scientific paper

In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first treat the case of antidirected paths in 5-chromatic digraphs, where we explain El-Sahili's theorem and provide an elementary and shorter proof of it. We then treat the case of paths with two blocks in n-chromatic digraphs with n greater than 4, where we explain the two different approaches of Addario-Berry et al. and of El-Sahili. We indicate a mistake in Addario-Berry et al.'s proof and provide a correction for it.

Affiliated with

Also associated with

No associations

Rating

Oriented paths in n-chromatic digraphs 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 Oriented paths in n-chromatic digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Oriented paths in n-chromatic digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-595313