Boxicity

From HandWiki
Revision as of 15:37, 6 February 2024 by S.Timg (talk | contribs) (correction)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Smallest dimension where a graph can be represented as an intersection graph of boxes
An intersection graph of rectangles, with boxicity two

In graph theory, boxicity is a graph invariant, introduced by Fred S. Roberts in 1969.

The boxicity of a graph is the minimum dimension in which a given graph can be represented as an intersection graph of axis-parallel boxes. That is, there must exist a one-to-one correspondence between the vertices of the graph and a set of boxes, such that two boxes intersect if and only if there is an edge connecting the corresponding vertices.

Examples

The figure shows a graph with six vertices, and a representation of this graph as an intersection graph of rectangles (two-dimensional boxes). This graph cannot be represented as an intersection graph of boxes in any lower dimension, so its boxicity is two.

(Roberts 1969) showed that the graph with 2n vertices formed by removing a perfect matching from a complete graph on 2n vertices has boxicity exactly n: each pair of disconnected vertices must be represented by boxes that are separated in a different dimension than each other pair. A box representation of this graph with dimension exactly n can be found by thickening each of the 2n facets of an n-dimensional hypercube into a box. Because of these results, this graph has been called the Roberts graph,[1] although it is better known as the cocktail party graph and it can also be understood as the Turán graph T(2n,n).

Relation to other graph classes

A graph has boxicity at most one if and only if it is an interval graph; the boxicity of an arbitrary graph G is the minimum number of interval graphs on the same set of vertices such that the intersection of the edges sets of the interval graphs is G. Every outerplanar graph has boxicity at most two,[2] and every planar graph has boxicity at most three.[3]

If a bipartite graph has boxicity two, it can be represented as an intersection graph of axis-parallel line segments in the plane.[4]

(Adiga Bhowmick) proved that the boxicity of a bipartite graph G is within of a factor 2 of the order dimension of the height-two partially ordered set associated to G as follows: the set of minimal elements corresponds to one partite set of G, the set of maximal elements corresponds to the second partite set of G, and two elements are comparable if the corresponding vertices are adjacent in G. Equivalently, the order dimension of a height-two partially ordered set P is within a factor 2 of the boxicity of the comparability graph of P (which is bipartite, since P has height two).

Algorithmic results

Many graph problems can be solved or approximated more efficiently for graphs with bounded boxicity than they can for other graphs; for instance, the maximum clique problem can be solved in polynomial time for graphs with bounded boxicity.[5] For some other graph problems, an efficient solution or approximation can be found if a low-dimensional box representation is known.[6] However, finding such a representation may be difficult: it is NP-complete to test whether the boxicity of a given graph is at most some given value K, even for K = 2.[7] (Chandran Francis) describe algorithms for finding representations of arbitrary graphs as intersection graphs of boxes, with a dimension that is within a logarithmic factor of the maximum degree of the graph; this result provides an upper bound on the graph's boxicity.

Despite being hard for its natural parameter, boxicity is fixed-parameter tractable when parameterized by the vertex cover number of the input graph.[8]

Bounds

If a graph G graph has m edges, then: [math]\displaystyle{ box(G) = O(\sqrt{m \cdot \log(m)}) }[/math].[9][10]

If a graph G is k-degenerate (with [math]\displaystyle{ k\ge 2 }[/math]) and has n vertices, then G has boxicity [math]\displaystyle{ box(G) \le (k+2) \lceil 2e \log n \rceil }[/math].[11]

If a graph G has no complete graph on t vertices as a minor, then [math]\displaystyle{ box(G) = O(t^2 \log t) }[/math][12] while there are graphs with no complete graph on t vertices as a minor, and with boxicity [math]\displaystyle{ \Omega(t \sqrt{\log t}) }[/math].[13] In particular, any graph G hax boxicity [math]\displaystyle{ box(G) = O(\mu(G)^2 \log \mu(G)) }[/math], where [math]\displaystyle{ \mu(G) }[/math] denotes the Colin de Verdière invariant of G.

Related graph invariants

  • Cubicity is defined in the same way as boxicity but with axis-parallel hypercubes instead of hyperrectangles. Boxicity is a generalization of cubicity.
  • Sphericity is defined in the same way as boxicity but with unit-diameter spheres.


Notes

  1. ↑ E.g., see (Chandran Francis) and (Chandran Sivadasan).
  2. ↑ (Scheinerman 1984).
  3. ↑ (Thomassen 1986).
  4. ↑ (Bellantoni Ben-Arroyo Hartman).
  5. ↑ (Chandran Francis) observe that this follows from the fact that these graphs have a polynomial number of maximal cliques, i.e., the class of graphs with bounded boxicity is said to have few cliques. An explicit box representation is not needed to list all maximal cliques efficiently.
  6. ↑ See, e.g., (Agarwal van Kreveld) and (Berman DasGupta) for approximations to the maximum independent set for intersection graphs of rectangles, and (Chlebík Chlebíková) for results on hardness of approximation of these problems in higher dimensions.
  7. ↑ (Cozzens 1981) shows that computing the boxicity is NP-complete; (Yannakakis 1982) shows that even checking whether the boxicity is at most 3 is NP-hard; finally (Kratochvil 1994) showed that recognising boxicity 2 is NP-hard.
  8. ↑ (Adiga Chitnis).
  9. ↑ (Chandran Francis)
  10. ↑ (Esperet 2016)
  11. ↑ (Adiga Chandran)
  12. ↑ (Esperet Wiechert)
  13. ↑ (Esperet 2016)

References



Retrieved from "https://handwiki.org/wiki/index.php?title=Boxicity&oldid=3363172"