Mathematics – Combinatorics
Scientific paper
1995-02-09
J. Combin. Theory Ser. A 73 (1996), no. 1, 185--18
Mathematics
Combinatorics
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
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.
Profile ID: LFWR-SCP-O-390995