Browsing Waterloo Research by Subject "bipartite graph"
Now showing items 1-2 of 2
-
Pure pairs. IV. Trees in bipartite graphs.
(Elsevier, 2023-07)In this paper we investigate the bipartite analogue of the strong Erd˝os-Hajnal property. We prove that for every forest H and every τ with 0 < τ ≤ 1, there exists ε > 0, such that if G has a bipartition (A,B) and does not ... -
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix
(Elsevier, 2023-07)For integer n>0, let f(n) be the number of rows of the largest all-0 or all-1 square submatrix of M, minimized over all n x n 0/1-matrices M. Thus f(n)=O(log n). But let us fix a matrix H, and define fH(n) to be the same, ...