已收录 268921 条政策
 政策提纲
  • 暂无提纲
On a theorem of J. Ossowski
[摘要] Consider any matrix of zeros and ones with at most n ones in each row and fewer than (k + 1)n ones in all. Ossowski showed that, by deleting no more than k columns, one can get a matrix which contains no r x (n - r + 1) submatrix of ones for r = 1, 2, ..., n. We give a short proof of Ossowski's theorem in the slightly stronger form: any minimal set of columns, whose deletion has the desired effect, has cardinality at most k. (C) 1997 Academic Press.
[发布日期] 1997-04-01 [发布机构] 
[效力级别]  [学科分类] 
[关键词]  [时效性] 
   浏览次数:1      统一登录查看全文      激活码登录查看全文