solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看4002次
Local Boxicity, Local Dimension, and Maximum Degree. (arXiv:1810.02963v1 [math.CO])
来源于:arXiv
In this short note we focus on two recently introduced parameters in the
literature, namely `local dimension' (a parameter on partially ordered sets)
and `local boxicity' (a parameter on graphs). First we establish a relation
between them and then we give an upper bound for both the parameters in terms
of the maximum degree of a graph (for local dimension we consider the
comparability graph of a poset). Finally, we show that the local boxicity of a
graph is upper bounded by its `product dimension'. 查看全文>>