The Knowlton-Graham partition problem (Q1906132)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Knowlton-Graham partition problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Knowlton-Graham partition problem |
scientific article |
Statements
The Knowlton-Graham partition problem (English)
0 references
13 May 1996
0 references
The main purpose of this paper is to resolve an open problem stated by Graham, viz. Knowlton-Graham partitions of order \(m\) do exist for all \(n\) in the range \((\begin{smallmatrix} m+ 1\\ 2\end{smallmatrix})\leq n\leq J(m)\). The proof involves a construction of \(0-1\) matrices having row and column sums without gaps.
0 references
symmetric matrix
0 references
Knowlton-Graham partitions
0 references
0-1 matrices
0 references
column sums
0 references
0 references
0 references
0 references
0.88958335
0 references
0 references
