Abstract
For any bipartite graph $H$, we determine a minimum degree threshold for a balanced bipartite graph $G$ to contain a perfect $H$-tiling. We show that this threshold is best possible up to a constant depending only on $H$. Additionally, we prove a corresponding minimum degree threshold to guarantee that $G$ has an $H$-tiling missing only a constant number of vertices. Our threshold for the perfect tiling depends on either the chromatic number $\chi(H)$ or the critical chromatic number $\chi_{cr}(H)$ while the threshold for the almost perfect tiling only depends on $\chi_{cr}(H)$. Our results answer two questions of Zhao. They can be viewed as bipartite analogs to the results of Kuhn and Osthus and of Shokoufandeh and Zhao.
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.
