Paths and stability number in digraphs

Details Paths and stability number in digraphs Paths and stability number in digraphs

2009-05-16

arxiv.org/abs/0905.2644v3

Mathematics

Combinatorics

3 pages

Scientific paper

The Gallai-Milgram theorem says that the vertex set of any digraph with stability number k can be partitioned into k directed paths. In 1990, Hahn and Jackson conjectured that this theorem is best possible in the following strong sense. For each positive integer k, there is a digraph D with stability number k such that deleting the vertices of any k-1 directed paths in D leaves a digraph with stability number k. In this note, we prove this conjecture.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-503639