A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix

Details A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix

2011-09-02

arxiv.org/abs/1109.0562v1

Computer Science

Data Structures and Algorithms

7 pages

Scientific paper

A binary matrix has the consecutive ones property (C1P) if it is possible to order the columns so that all 1s are consecutive in every row. In [McConnell, SODA 2004 768-777] the notion of incompatibility graph of a binary matrix was introduced and it was shown that odd cycles of this graph provide a certificate that a matrix does not have the consecutive ones property. A bound of (k+2) was claimed for the smallest odd cycle of a non-C1P matrix with k columns. In this note we show that this result can be obtained simply and directly via Tucker patterns, and that the correct bound is (k+2) when k is even, but (k+3) when k is odd.

Affiliated with

Also associated with

No associations

Rating

A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix 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 A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-147386