Abstract
Let $s<t$ be two fixed positive integers. We study sufficient minimum-degree conditions for a bipartite graph G, with both color classes of size $n=k(s+t)$, which ensure that G has a $K_{s,t}$-factor. Our result extends the work of Zhao, who determined the minimum-degree threshold which guarantees that a bipartite graph has a $K_{s,s}$-factor.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
