Open AccessPosted Content
Large homogeneous submatrices
TL;DR: It is proved that if an $n\times n$ zero-one matrix A does not contain P as a submatrix, then A has an $cn\times cn$ homogeneous sub matrix for a suitable constant $c>0$.
read more
Abstract: A matrix is homogeneous if all of its entries are equal. Let $P$ be a $2\times 2$ zero-one matrix that is not homogeneous. We prove that if an $n\times n$ zero-one matrix $A$ does not contain $P$ as a submatrix, then $A$ has an $cn\times cn$ homogeneous submatrix for a suitable constant $c>0$. We further provide an almost complete characterization of the matrices $P$ (missing only finitely many cases) such that forbidding $P$ in $A$ guarantees an $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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
TL;DR: Here, it is proved that h(Forb(n, H) is linear in n for all strongly acyclic graphs except for four graphs.
8
Graph classes with linear Ramsey numbers
TL;DR: In this paper, it was shown that if X is a hereditary class defined by finitely many forbidden induced subgraphs, then Ramsey numbers are linear in X if and only if X excludes a forest, a disjoint union of cliques and their complements.
7
•Posted Content
Pure pairs. IV. Trees in bipartite graphs
TL;DR: In this article, the bipartite analogue of the strong Erdos-Hajnal property was investigated, and it was shown that for every forest and every tree, there exists a stable set in the stable set that contains at least (1 − ε)-epsilon|V_i|$ vertices of V_i, for ε = 1,2.
•Posted Content
Graph classes with linear Ramsey numbers
TL;DR: The conjecture that if X is a hereditary class defined by finitely many forbidden induced subgraphs, then Ramsey numbers are linear in X if and only if the co-chromatic number is bounded in $X$.
4
•Posted Content
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix
TL;DR: In this paper, it was shown that the problem of minimizing the number of rows of the largest all-0 or all-1 square submatrix of a matrix is solvable in O(log n) time.
2
References
•Book
Hypergraphs: Combinatorics of Finite Sets
Claude Berge
- 11 Jul 2011
TL;DR: This chapter discusses Hypergraphs Generalising Bipartite Graphs, which are a collection of hypergraphs designed to solve the problem of Uniform Colourings in Matroids, and some of the properties of these graphs.
1K
Excluded permutation matrices and the Stanley-Wilf conjecture
Adam Marcus,Gábor Tardos +1 more
TL;DR: This paper examines the extremal problem of how many 1-entries an n × n 0-1 matrix can have that avoids a certain fixed submatrix P and proves a linear bound for any permutation matrix P.
Ramsey-type theorems
Paul Erdős,Andras Hajnal +1 more
TL;DR: In this paper, the existence of large homogeneous (monochromatic) configurations of a certain kind under the condition that the size of the underlying set is large is investigated.
336
Davenport-Schnizel theory of matrices
TL;DR: Among other results it is proved that f ( n ; 1 1 11 1 ) = Θ ( α ( n ) n ), where α( n ) is the inverse of the Ackermann function.
186