On tree width, bramble size, and expansion

@article{Grohe2009OnTW,
  title={On tree width, bramble size, and expansion},
  author={Martin Grohe and D{\'a}niel Marx},
  journal={J. Comb. Theory, Ser. B},
  year={2009},
  volume={99},
  pages={218-228}
}
A bramblein a graphG is a family of connected subgraphs of G such that any two of these subgraphs have a nonempty intersection or are joined by an edge. The ord r of a bramble is the least number of vertices required to cover every subgraph in the bramble. Seymour and Thomas [8] proved that the maximum order of a bramble in a graph is precisely the tree wid th of the graph plus one. We prove that every graph of tree width at least k has a bramble of order Ω(k1/2/ log2k) and size polynomial in… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Expander graphs an d their applications.Bulletin of the AMS

  • S. Hoory, N. Linial, A. Wigderson
  • 2006
1 Excerpt

LeeImproved approximation algorithms for minimumweight vertex separators

  • Uriel Feige, Mohammad Taghi Hajiaghayi, R James
  • STOC ’ 05 : Proceedings of the 37 th Annual ACM…
  • 2005

Tree width and tangles: A new connectivity measu re and some applications

  • B. Reed
  • 1997
1 Excerpt

Graph searching and a minmax theorem for treewidth

  • R. Thomas.
  • Journal of Combinatorial Theory , Series B
  • 1993

Similar Papers

Loading similar papers…