On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph |
| |
| Authors: | Hong Wang |
| |
| Affiliation: | (1) Department of Mathematics, University of Idaho, Moscow, Idaho, 83844, USA e-mail: hwang@uidaho.edu, US |
| |
| 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]. Received: March 27, 1996 Revised: March 7, 1997 |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
