arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.07686cs.DMcs.DSmath.CO
收藏

关于可比盒维数

On Comparable Box Dimension

Zdenek Dvorák, Daniel Goncalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt

摘要:

如果$\mathbb{R}^d$中的两个框之一是另一个框的翻译子集,则这两个框是可比较的。图$G$的可比盒维数是最小整数$d$,使得$G$可以表示为$\mathbb{R}^d$中可比轴对齐盒的接触图。我们表明,适当的小封闭类有界可比盒尺寸,并探讨这一概念的进一步性质。

英文摘要:

Two boxes in $\mathbb{R}^d$ are comparable if one of them is a subset of a translation of the other one. The comparable box dimension of a graph $G$ is the minimum integer $d$ such that $G$ can be represented as a touching graph of comparable axis-aligned boxes in $\mathbb{R}^d$. We show that proper minor-closed classes have bounded comparable box dimensions and explore further properties of this notion.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑