Title of article
The Knowlton–Graham Partition Problem
Author/Authors
Knuth، نويسنده , , Donald E.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
5
From page
185
To page
189
Abstract
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.
Journal title
Journal of Combinatorial Theory Series A
Serial Year
1996
Journal title
Journal of Combinatorial Theory Series A
Record number
1530073
Link To Document