Abstract.
We show that, if G=(X,Y;E) is a bipartite graph with |X|=|Y|=4s and δ(G)≥4s−3 for any integer s≥2, then G contains four vertex-disjoint copies of K s,s. This constitutes a partial answer to a conjecture in [4].
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: March 27, 1996 Revised: March 7, 1997
Rights and permissions
About this article
Cite this article
Wang, H. On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph. Graphs Comb 15, 353–364 (1999). https://doi.org/10.1007/s003730050069
Issue Date:
DOI: https://doi.org/10.1007/s003730050069