Forbidden Submatrices: Some New Bounds and Constructions

[摘要] We explore an extremal hypergraph problem for which both the vertices and edges are ordered. Given a hypergraph $F$ (not necessarily simple), we consider how many edges a simple hypergraph (no repeated edges) on $m$ vertices can have while forbidding $F$

[学科分类] 离散数学和组合数学

[关键词] extremal set theory;forbidden submatrix;ordered sets;trace;amortized analysis