Dushnik-Miller dimension of d-dimensional tilings with boxes
Discrete Mathematics
2018-09-17 v1 Combinatorics
Abstract
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 .
Keywords
Cite
@article{arxiv.1809.05287,
title = {Dushnik-Miller dimension of d-dimensional tilings with boxes},
author = {Mathew C. Francis and Daniel Gonçalves},
journal= {arXiv preprint arXiv:1809.05287},
year = {2018}
}
Comments
14 pages