On Comparable Box Dimension
Discrete Mathematics
2022-03-16 v1 Data Structures and Algorithms
Combinatorics
Abstract
Two boxes in are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph is the minimum integer such that can be represented as a touching graph of comparable axis-aligned boxes in . We show that proper minor-closed classes have bounded comparable box dimensions and explore further properties of this notion.
Cite
@article{arxiv.2203.07686,
title = {On Comparable Box Dimension},
author = {Zdenek Dvorák and Daniel Goncalves and Abhiruk Lahiri and Jane Tan and Torsten Ueckerdt},
journal= {arXiv preprint arXiv:2203.07686},
year = {2022}
}
Comments
23 pages, 1 figure, accepted for presentation at SoCG 2022