A note on bipartite graph tiling

Andrzej Czygrinow, Louis Debiasio

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Bipartite graph tiling was studied by Zhao [SIAM J. Discrete Math., 23 (2009), pp. 888-900], who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of K s, s. Let s < t be fixed positive integers. Hladký and Schacht [SIAM J. Discrete Math., 24 (2010), pp. 357-362] gave minimum degree conditions for a balanced bipartite graph on 2m(s + t) vertices to contain m vertex disjoint copies of K s, t. Their results were best possible, except in the case when m is odd and t > 2s+1. We give the best possible minimum degree condition in this case.

Original languageEnglish (US)
Pages (from-to)1477-1489
Number of pages13
JournalSIAM Journal on Discrete Mathematics
Volume25
Issue number4
DOIs
StatePublished - Dec 1 2011

Keywords

  • Factorization
  • Packing

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'A note on bipartite graph tiling'. Together they form a unique fingerprint.

Cite this