Skip to main content

Brambles, Prisms and Grids

  • Chapter

Part of the book series: Trends in Mathematics ((TM))

Abstract

The Cartesian product C κ × K 2 of a circuit of length κ with K 2 is called a κ-prism. It is well known that graphs not having the κ-prism as a minor have their tree-width bounded by an exponential function of κ. Using brambles and their well-studied relation to tree-width, we show that they have in fact tree-width O(κ 2). As a consequence, we obtain new bounds on the tree-width of graphs having no small grid as a minor.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Birmelé, J.A. Bondy and B. Reed, The tree-width of the (3 × 3)-grid, manuscript.

    Google Scholar 

  2. R. Diestel, Graph Theory, Second edition. Graduate Texts in Mathematics, 173. Springer-Verlag, New York, 2000.

    Google Scholar 

  3. R. Diestel, K.Yu. Gorbunov, T.R. Jensen and C. Thomassen, Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser.B, 75 (1999), 61–73.

    Article  MathSciNet  Google Scholar 

  4. P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470.

    Google Scholar 

  5. B.A. Reed, Tree width and tangles: a new connectivity measure and some applications, in Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press, Cambridge, 1997, 87–162.

    Google Scholar 

  6. N. Robertson and P.D. Seymour, Graph minors V: Excluding a planar graph, J. Combin. Theory Ser.B, 41 (1986), 92–114.

    Article  MathSciNet  Google Scholar 

  7. P.D. Seymour and R. Thomas, Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B, 58 (1993), 22–33.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Birkhäuser Verlag Basel/Switzerland

About this chapter

Cite this chapter

Birmelé, E., Bondy, J.A., Reed, B.A. (2006). Brambles, Prisms and Grids. In: Bondy, A., Fonlupt, J., Fouquet, JL., Fournier, JC., Ramírez Alfonsín, J.L. (eds) Graph Theory in Paris. Trends in Mathematics. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7400-6_4

Download citation

Publish with us

Policies and ethics