Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs

Details Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs

2009-10-16

arxiv.org/abs/0910.3014v1

Mathematics

Combinatorics

Scientific paper

We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these parameters is sublinear in the number of vertices of G then so are all the others. This implies for example that graphs of fixed genus have sublinear bandwidth or, more generally, a corresponding result for graphs with any fixed forbidden minor. As a consequence we establish a simple criterion for universality for such classes of graphs and show for example that for each gamma>0 every n-vertex graph with minimum degree ((3/4)+gamma)n contains a copy of every bounded-degree planar graph on n vertices if n is sufficiently large.

Affiliated with

Also associated with

No associations

Rating

Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs 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 Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-123179