arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.05055math.COcs.DM
收藏

偶映射、Colin de~Verdière数与图的表示

Even maps, the Colin de~Verdière number and representations of graphs

Vojtěch Kaluža, Martin Tancer

摘要:

Van der Holst和Pendavingh引入了一个图参数$σ$,它与更著名的Colin de Verdière图参数$μ$在小值时一致。然而,$σ$的定义更加几何/拓扑,直接反映了图的可嵌入性属性。他们证明了对任何图$G$都有$μ(G) \leq σ(G) + 2$和证明了$μ(G) \leq σ(G)$。我们证实了这一猜想。据我们所知,这是$μ(G)$的第一个拓扑上界,一般来说,它是紧的。$μ$和$σ$之间的相等一般不成立,因为van der Holst和Pendavingh表明存在一个图$G$与$μ(G) \leq 18$和$σ(G)\geq 20$。我们发现,差距出现在更小的值,即,我们展示了一个图形$H$,其中$μ(H)\leq 7$和$σ(H)\geq 8$。我们还证明,在一般情况下,差距可以很大:的关联图$H_q$有限的顺序$q$射影平面满足$μ(H_q) \in O(q^{3/2})$和$σ(H_q) \geq q^2$。

英文摘要:

Van der Holst and Pendavingh introduced a graph parameter $σ$, which coincides with the more famous Colin de Verdière graph parameter $μ$ for small values. However, the definition of $σ$ is much more geometric/topological directly reflecting embeddability properties of the graph. They proved $μ(G) \leq σ(G) + 2$ and conjectured $μ(G) \leq σ(G)$ for any graph $G$. We confirm this conjecture. As far as we know, this is the first topological upper bound on $μ(G)$ which is, in general, tight. Equality between $μ$ and $σ$ does not hold in general as van der Holst and Pendavingh showed that there is a graph $G$ with $μ(G) \leq 18$ and $σ(G)\geq 20$. We show that the gap appears on much smaller values, namely, we exhibit a graph $H$ for which $μ(H)\leq 7$ and $σ(H)\geq 8$. We also prove that, in general, the gap can be large: The incidence graphs $H_q$ of finite projective planes of order $q$ satisfy $μ(H_q) \in O(q^{3/2})$ and $σ(H_q) \geq q^2$.

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

↑