Concatenating bipartite graphs

Maria Chudnovsky, Patrick Hompe, Alex Scott +2

Let $x,y\in (0,1]$ and let $A,B,C$ be disjoint nonempty subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbours in $B$, and every vertex in $B$ has at least…