Embedding spanning bipartite graphs of small bandwidth

Details Embedding spanning bipartite graphs of small bandwidth Embedding spanning bipartite graphs of small bandwidth

2011-11-18

arxiv.org/abs/1111.4292v1

Mathematics

Combinatorics

22 pages

Scientific paper

Boettcher, Schacht and Taraz gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth o(n), thereby proving a conjecture of Bollobas and Komlos. We strengthen this result in the case when H is bipartite. Indeed, we give an essentially best-possible condition on the degree sequence of a graph G on n vertices that forces G to contain every bipartite graph H on n vertices of bounded degree and of bandwidth o(n). This also implies an Ore-type result. In fact, we prove a much stronger result where the condition on G is relaxed to a certain robust expansion property. Our result also confirms the bipartite case of a conjecture of Balogh, Kostochka and Treglown concerning the degree sequence of a graph which forces a perfect H-packing.

Affiliated with

Also associated with

No associations

Rating

Embedding spanning bipartite graphs of small bandwidth 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 Embedding spanning bipartite graphs of small bandwidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedding spanning bipartite graphs of small bandwidth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548654