AN EXTREMAL PROBLEM ON SPARSE 0-1 MATRICES

被引：30

作者：

BIENSTOCK, D

GYORI, E

机构：

[1] BELLCORE,MORRISTOWN,NJ 07960

[2] HUNGARIAN ACAD SCI,INST MATH,H-1361 BUDAPEST 5,HUNGARY

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 1991年 / 4卷 / 01期

关键词：

EXTREMAL PROBLEMS;

D O I：

10.1137/0404002

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The problem of estimating the number of 1's in a square 0-1 matrix with certain forbidden configurations is considered, and nearly tight bounds are provided. This is motivated by a problem in computational geometry.

引用

页码：17 / 27

页数：11