Mathematics – Combinatorics
Scientific paper
2008-06-19
Mathematics
Combinatorics
17 pages
Scientific paper
An axis-parallel $b$-dimensional box is a Cartesian product $R_1\times R_2\times...\times 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 \emph{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. Applying these methods we give several results, some of which are listed below: (1) The boxicity of a graph on $n$ vertices with no universal vertices and minimum degree $\delta$ is at least $n/2(n-\delta-1)$. (2) Consider the $\mathcal{G}(n,p)$ model of random graphs. Let $p$ be such that $c_1/n\le p\le1-c_2\frac{\log n}{n^2}$, where $c_1$ and $c_2$ are predetermined constants. Then, for $G\in\mathcal{G}(n,p)$, almost surely $box(G)=\Omega(np(1-p))$. On setting $p=1/2$ we immediately infer that almost all graphs have boxicity $\Omega(n)$. (3) Spectral lower bounds for the boxicity of $k$-regular graphs. (4) The boxicity of random $k$-regular graphs on $n$ vertices (where $k$ is fixed) is $\Omega(k/\log k)$. (5) There exists a positive constant$c_3'$ such that almost all balanced bipartite graphs on $2n$ vertices with exactly $m$ edges have boxicity at least $c_3'm/(n\log n)$, where $c_1'n\log n\le m\le n^2-c_2'n$ and $c_1'$ and $c_2'$ are predefined constants.
Adiga Abhijin
Chandran Sunil L.
Sivadasan Naveen
No associations
LandOfFree
Lower Bounds for Boxicity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Lower Bounds for Boxicity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds for Boxicity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-562981