arXiv · math/9502237
The Knowlton-Graham partition problem
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Donald E. Knuth. 1995-02-09. The Knowlton-Graham partition problem. https://searcharxiv.com/abs/math/9502237
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.