A note on bipartite graph tiling

Details A note on bipartite graph tiling A note on bipartite graph tiling

2011-04-12

arxiv.org/abs/1104.2099v1

Mathematics

Combinatorics

15 pages; To appear in SIAM Journal on Discrete Mathematics

Scientific paper

Bipartite graph tiling was studied by Zhao 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 2s+1. We give the best possible minimum degree condition in this case.

Affiliated with

Also associated with

No associations

Rating

A note on bipartite graph tiling 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 A note on bipartite graph tiling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on bipartite graph tiling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-730942