加载中…
A matrix is homogeneous if all of its entries are equal. Let be a zero-one matrix that is not homogeneous. We prove that if an zero-one matrix does not contain as a submatrix, then has an homogeneous submatrix for a suitable constant . We further provide an almost complete characterization of the matrices (missing only finitely many cases) such that forbidding in guarantees an homogeneous submatrix. We apply our results to chordal bipartite graphs, totally balanced matrices, halfplane-arrangements and string graphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本