The Knowlton-Graham partition problem

Simple item page
dc.creatorKnuth, Donald E.
dc.date1995-02-09
dc.date.accessioned2026-07-07T09:15:17Z
dc.date.available2026-07-07T09:15:17Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/math/9502237
dc.identifierhttp://arxiv.org/abs/math/9502237
dc.identifierJ. Combin. Theory Ser. A 73 (1996), no. 1, 185--18
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152966
dc.subjectCombinatorics
dc.titleThe Knowlton-Graham partition problem
dc.typetext

Files

Collections

arXiv