Note on bipartite graph tilings

Details Note on bipartite graph tilings Note on bipartite graph tilings

2008-06-06

arxiv.org/abs/0806.1192v2

Mathematics

Combinatorics

6 pages, no figures; statement of the main theorem corrected (thanks to Andrzej Czygrinow and Louis DeBiasio); to appear in SI

Scientific paper

Let sconditions 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. Exact result for large n is given.
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.

Affiliated with

Also associated with

No associations

Rating

Note on bipartite graph tilings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Note on bipartite graph tilings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Note on bipartite graph tilings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-173067