The Knowlton-Graham partition problem

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

A set partition technique that is useful for identifying wires in cables can
be recast in the language of 0--1 matrices, thereby resolving an open problem
stated by R.~L. Graham in Volume 1 of this journal. The proof involves a
construction of 0--1 matrices having row and column sums without gaps.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Knowlton-Graham partition problem 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 The Knowlton-Graham partition problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Knowlton-Graham partition problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-390995

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.