The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Lower Bounds for Boxicity
[article]
2012
arXiv
pre-print
An axis-parallel b-dimensional box is a Cartesian product R_1× R_2×...× R_b where R_i is a closed interval of the form [a_i,b_i] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds.
arXiv:0806.3175v2
fatcat:lypycwxyhzapheqdqsqbzz73bq