Abstract
We investigate the class of intersection graphs of paths on a grid (VPG graphs), and specifically the relationship between the bending number of a cocomparability graph and the poset dimension of its complement. We show that the bending number of a cocomparability graph G is at most the poset dimension of the complement of G minus one. Then, via Ramsey type arguments, we show our upper bound is best possible.
Original language | English |
---|---|
Pages (from-to) | 39-49 |
Number of pages | 11 |
Journal | Order |
Volume | 33 |
Issue number | 1 |
DOIs | |
State | Published - 1 Mar 2016 |
Bibliographical note
Publisher Copyright:© 2015, Springer Science+Business Media Dordrecht.
Keywords
- Bending number
- Cocomparability graph
- Dimension
- Poset
- Product Ramsey theorem
ASJC Scopus subject areas
- Algebra and Number Theory
- Geometry and Topology
- Computational Theory and Mathematics