Adiga, Abhijin and Bhowmick, Diptendu and Chandran, Sunil L
(2010)
*Boxicity and Poset Dimension.*
In: 16th Annual International Computing and Combinatorics Conference, JUL 19-21, 2010 , Nha Trang, VIETNAM, pp. 3-12.

PDF
boxicity.pdf - Published Version Restricted to Registered users only Download (198Kb) | Request a copy |

## Abstract

Let G be a simple, undirected, finite graph with vertex set V(G) and edge set E(C). A k-dimensional box is a Cartesian product of closed intervals a(1), b(1)] x a(2), b(2)] x ... x a(k), b(k)]. The boxicity of G, box(G) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes, i.e. each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset where S is the ground set and P is a reflexive, anti-symmetric and transitive binary relation on S. The dimension of P, dim(P) is the minimum integer l such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with its extended double cover, denoted as G(c). Let P-c be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P-c) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension. In the other direction, using the already known bounds for partial order dimension we get the following: (I) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta) which is an improvement over the best known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0, unless NP=ZPP.

Item Type: | Conference Paper |
---|---|

Additional Information: | Copyright of this article belongs to Springer. |

Keywords: | Boxicity; partial order;poset dimension;comparability graph; extended double cover |

Department/Centre: | Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation) |

Date Deposited: | 14 Mar 2011 07:07 |

Last Modified: | 29 Feb 2012 07:17 |

URI: | http://eprints.iisc.ernet.in/id/eprint/36054 |

### Actions (login required)

View Item |