低色数图的盒度立方度上界
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number
摘要:
图$G$的盒度(相应立方度)是最小非负整数$k$,使得$G$可以表示为轴平行的$k$维盒(相应$k$维单位立方体)的相交图,并且由$box(G)$(相应$cub(G)$)表示。Adiga和Adirran(Journal of Graph Theory,65(4),2010)证明了对于任何图$G$,$cub(G) \le$盒$(G) \left \lceil \log_2 α\right \rceil$,其中$α= α(G)$是$G$中最大独立集的基数。在本说明中,我们表明,$cub(G) \le 2 \left \lceil \log_2 χ(G) \right \rceil box(G) + χ(G) \left \lceil \log_2 α(G) \right \rceil $。在一般情况下,这个结果可以提供一个更好的上界比Adiga和Adirran的图类的有界色数。例如,对于二分图,我们得到$cub(G) \le 2 (box(G) + \left \lceil \log_2 α(G) \right \rceil )$。证明了对每一个正整数$k$,存在具有色数$k$的图,使得对每一个$ε> 0$,我们的上界给出的值至多是其立方度的$(1+ε)$倍.因此,我们的上界几乎是紧的。
英文摘要:
The boxicity (respectively cubicity) of a graph $G$ is the minimum non-negative integer $k$, such that $G$ can be represented as an intersection graph of axis-parallel $k$-dimensional boxes (respectively $k$-dimensional unit cubes) and is denoted by $box(G)$ (respectively $cub(G)$). It was shown by Adiga and Chandran (Journal of Graph Theory, 65(4), 2010) that for any graph $G$, $cub(G) \le$ box$(G) \left \lceil \log_2 α\right \rceil$, where $α= α(G)$ is the cardinality of the maximum independent set in $G$. In this note we show that $cub(G) \le 2 \left \lceil \log_2 χ(G) \right \rceil box(G) + χ(G) \left \lceil \log_2 α(G) \right \rceil $. In general, this result can provide a much better upper bound than that of Adiga and Chandran for graph classes with bounded chromatic number. For example, for bipartite graphs we get, $cub(G) \le 2 (box(G) + \left \lceil \log_2 α(G) \right \rceil )$. Moreover we show that for every positive integer $k$, there exist graphs with chromatic number $k$, such that for every $ε> 0$, the value given by our upper bound is at most $(1+ε)$ times their cubicity. Thus, our upper bound is almost tight.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。