English

Large homogeneous submatrices

Combinatorics 2020-10-13 v3

Abstract

A matrix is homogeneous if all of its entries are equal. Let PP be a 2×22\times 2 zero-one matrix that is not homogeneous. We prove that if an n×nn\times n zero-one matrix AA does not contain PP as a submatrix, then AA has an cn×cncn\times cn homogeneous submatrix for a suitable constant c>0c>0. We further provide an almost complete characterization of the matrices PP (missing only finitely many cases) such that forbidding PP in AA guarantees an n1o(1)×n1o(1)n^{1-o(1)}\times n^{1-o(1)} 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

R2 v1 2026-06-23T08:09:31.513Z