AbstractIn 1977, Ganter and Teirlinck proved that any 2t × 2t matrix with 2t nonzero elements can be partitioned into four submatrices of order t of which at most two contain nonzero elements. In 1978, Kramer and Mesner conjectured that any mt × nt matrix with kt nonzero elements can be partitioned into mn submatrices of order t of which at most k contain nonzero elements. We show that this conjecture is true for some values of m, n, t and k but that it is false in general
AbstractGiven a symmetric m by m matrix M over 0,1,*, the M-partition problem asks whether or not an...
The M -partition problem can be stated as follows. Given a symmetric m × m matrixover {0, 1, ∗} we a...
Given a symmetric matrix M ∈ {0, 1, ∗}D×D, an M-partition of a graph G is a function from V (G) to D...
AbstractIn 1977, Ganter and Teirlinck proved that any 2t×2t matrix with 2t nonzero elements can be p...
AbstractIn 1977, Ganter and Teirlinck proved that any 2t×2t matrix with 2t nonzero elements can be p...
AbstractLet M be a matrix with entries from {1, 2,…, s} with n rows such that no matrix M′ formed by...
AbstractLet c = c(m,n,j,k) be the largest integer such that every matrix with m rows and n columns w...
AbstractThe set of all 2×2 matrices with elements from a given set Ω is partitioned into a finite nu...
AbstractLetα1, …, αkbe partitions of 2nwith at leastn 1's andβ1, …, βkbe partitions of 2nwith exactl...
AbstractIn this paper the following theorem is proved and generalized. The partitions of any positiv...
AbstractThis paper examines the extremal problem of how many 1-entries an n×n 0–1 matrix can have th...
AbstractThe family {An}n∈N of divisor matrices was introduced by Raphael Yuster (Discrete Math. 224 ...
AbstractZarankiewicz, in problem P 101, Colloq. Math., 2 (1951), p. 301, and others have posed the f...
AbstractIt is possible to find n partitions of an n-element set whose pairwise intersections are jus...
AbstractLet b(μKv) be the minimum number of complete bipartite subgraphs needed to partition the edg...
AbstractGiven a symmetric m by m matrix M over 0,1,*, the M-partition problem asks whether or not an...
The M -partition problem can be stated as follows. Given a symmetric m × m matrixover {0, 1, ∗} we a...
Given a symmetric matrix M ∈ {0, 1, ∗}D×D, an M-partition of a graph G is a function from V (G) to D...
AbstractIn 1977, Ganter and Teirlinck proved that any 2t×2t matrix with 2t nonzero elements can be p...
AbstractIn 1977, Ganter and Teirlinck proved that any 2t×2t matrix with 2t nonzero elements can be p...
AbstractLet M be a matrix with entries from {1, 2,…, s} with n rows such that no matrix M′ formed by...
AbstractLet c = c(m,n,j,k) be the largest integer such that every matrix with m rows and n columns w...
AbstractThe set of all 2×2 matrices with elements from a given set Ω is partitioned into a finite nu...
AbstractLetα1, …, αkbe partitions of 2nwith at leastn 1's andβ1, …, βkbe partitions of 2nwith exactl...
AbstractIn this paper the following theorem is proved and generalized. The partitions of any positiv...
AbstractThis paper examines the extremal problem of how many 1-entries an n×n 0–1 matrix can have th...
AbstractThe family {An}n∈N of divisor matrices was introduced by Raphael Yuster (Discrete Math. 224 ...
AbstractZarankiewicz, in problem P 101, Colloq. Math., 2 (1951), p. 301, and others have posed the f...
AbstractIt is possible to find n partitions of an n-element set whose pairwise intersections are jus...
AbstractLet b(μKv) be the minimum number of complete bipartite subgraphs needed to partition the edg...
AbstractGiven a symmetric m by m matrix M over 0,1,*, the M-partition problem asks whether or not an...
The M -partition problem can be stated as follows. Given a symmetric m × m matrixover {0, 1, ∗} we a...
Given a symmetric matrix M ∈ {0, 1, ∗}D×D, an M-partition of a graph G is a function from V (G) to D...