Large homogeneous submatrices
Combinatorics
2020-10-13 v3
Abstract
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.
Keywords
Cite
@article{arxiv.1903.06608,
title = {Large homogeneous submatrices},
author = {Dániel Korándi and János Pach and István Tomon},
journal= {arXiv preprint arXiv:1903.06608},
year = {2020}
}
Comments
21 pages, 2 figures. Revised version, a tabular overview of results added at the end