Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650421 | Discrete Mathematics | 2008 | 10 Pages |
Abstract
Call a simple graph HH of order nnwell-separable , if by deleting a separator set of size o(n)o(n) the leftover will have components of size at most o(n)o(n). We prove, that bounded degree well-separable spanning subgraphs are easy to embed: for every γ>0γ>0 and positive integer ΔΔ there exists an n0n0 such that if n>n0n>n0, Δ(H)⩽ΔΔ(H)⩽Δ for a well-separable graph HH of order nn and δ(G)⩾(1-1/2(χ(H)-1)+γ)nδ(G)⩾(1-1/2(χ(H)-1)+γ)n for a simple graph GG of order nn, then H⊂GH⊂G. We extend our result to graphs with small band-width, too.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Béla Csaba,