Forbidden Berge Hypergraphs

[摘要] A simple matrix is a (0,1)-matrix with no repeated columns. For a (0,1)-matrix $F$, we say that a (0,1)-matrix $A$ has $F$ as a Berge hypergraph if there is a submatrix $B$ of $A$ and some row and column permutation of $F$, say $G$, with $G\le B$. Letting

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

[关键词] Extremal graphs;Berge hypergraph;Forbidden configuration;Trace;Products