Forbidden Berge Hypergraphs

Electronic Journal Of Combinatorics

R. P. Anstee¹ 

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

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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

【 授权许可】

Others