AbstractLet c = c(m,n,j,k) be the largest integer such that every matrix with m rows and n columns whose entries belong to a set of cardinal c has a constant submatrix with j rows and k columns. Some results in the case j = 2 are given
summary:We define nice partitions of the multicomplex associated with a Stanley ideal. As the main r...
Several types of polarized partition relations are considered. In particular we deal with partitions...
AbstractGiven a symmetric m by m matrix M over 0,1,*, the M-partition problem asks whether or not an...
AbstractLet c = c(m,n,j,k) be the largest integer such that every matrix with m rows and n columns w...
AbstractIn this paper we establish a connection between polarized partition relations and the functi...
AbstractLet M be a matrix with entries from {1, 2,…, s} with n rows such that no matrix M′ formed by...
AbstractZarankiewicz, in problem P 101, Colloq. Math., 2 (1951), p. 301, and others have posed the f...
AbstractThe set of all 2×2 matrices with elements from a given set Ω is partitioned into a finite nu...
AbstractLet M be a class of matrices, M∗ a proper subclass of M, and ψ(n) = ψ(n;M,M∗) the largest in...
AbstractIn 1977, Ganter and Teirlinck proved that any 2t × 2t matrix with 2t nonzero elements can be...
AbstractIn 1977, Ganter and Teirlinck proved that any 2t×2t matrix with 2t nonzero elements can be p...
Abstract(1)Cardinalities permitting, a finite set partitioned in two ways is the union of disjoint m...
AbstractIn this paper we discuss a combinatorial problem involving graphs and matrices. Our problem ...
AbstractIn this paper we discuss a combinatorial problem involving graphs and matrices. Our problem ...
summary:We define nice partitions of the multicomplex associated with a Stanley ideal. As the main r...
summary:We define nice partitions of the multicomplex associated with a Stanley ideal. As the main r...
Several types of polarized partition relations are considered. In particular we deal with partitions...
AbstractGiven a symmetric m by m matrix M over 0,1,*, the M-partition problem asks whether or not an...
AbstractLet c = c(m,n,j,k) be the largest integer such that every matrix with m rows and n columns w...
AbstractIn this paper we establish a connection between polarized partition relations and the functi...
AbstractLet M be a matrix with entries from {1, 2,…, s} with n rows such that no matrix M′ formed by...
AbstractZarankiewicz, in problem P 101, Colloq. Math., 2 (1951), p. 301, and others have posed the f...
AbstractThe set of all 2×2 matrices with elements from a given set Ω is partitioned into a finite nu...
AbstractLet M be a class of matrices, M∗ a proper subclass of M, and ψ(n) = ψ(n;M,M∗) the largest in...
AbstractIn 1977, Ganter and Teirlinck proved that any 2t × 2t matrix with 2t nonzero elements can be...
AbstractIn 1977, Ganter and Teirlinck proved that any 2t×2t matrix with 2t nonzero elements can be p...
Abstract(1)Cardinalities permitting, a finite set partitioned in two ways is the union of disjoint m...
AbstractIn this paper we discuss a combinatorial problem involving graphs and matrices. Our problem ...
AbstractIn this paper we discuss a combinatorial problem involving graphs and matrices. Our problem ...
summary:We define nice partitions of the multicomplex associated with a Stanley ideal. As the main r...
summary:We define nice partitions of the multicomplex associated with a Stanley ideal. As the main r...
Several types of polarized partition relations are considered. In particular we deal with partitions...
AbstractGiven a symmetric m by m matrix M over 0,1,*, the M-partition problem asks whether or not an...
DOI
Add to ORKG