Dushnik-Miller dimension of contact systems of d -dimensional boxes

Mathew D. Francis (1) , Daniel Gonçalves (2)

1 Indian Statistical Institute [Chennai]
2 ALGCO - Algorithmes, Graphes et Combinatoire

Planar graphs are the graphs with Dushnik-Miller dimension at most three (W. Schnyder, Planar graphs and poset dimension, Order 5, 323-343, 1989). Consider the intersection graph of interior disjoint axis-parallel rectangles in the plane. It is known that if at most three rectangles intersect on a point, then this intersection graph is planar, that is it has Dushnik-Miller dimension at most three. This paper aims at generalizing this from the plane to by considering tilings of with axis parallel boxes, where at most boxes intersect on a point. Such tilings induce simplicial complexes and we will show that those simplicial complexes have Dushnik-Miller dimension at most.

Mots clés: Dushnik-Miller dimension; Tilings; Boxes; Simplicial complexes

Domaines: Mathématique discrète [cs.DM]

Mathew D. Francis, Daniel Gonçalves. Dushnik-Miller dimension of contact systems of d -dimensional boxes. Electronic Notes in Discrete Mathematics, 2017, 61, pp.467-473. ⟨10.1016/j.endm.2017.06.075⟩. ⟨lirmm-01693192⟩