1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Maria Axenovich, Casey Tompkins, Lea Weber
For a bipartite graph G, let h(G) be the largest t such that either G or the bipartite complement of G contain K_{t,t}. For a class F of graphs, let h(F)= min {h(G): G\in F}. We sa…