The Excluded Minors for Isometric Realizability in the Plane
The Excluded Minors for Isometric Realizability in the Plane
复制标题
平面内等距可实现性的排除未成年人
DOI:
--
复制
发表时间:
2015
影响因子:
0.8
通讯作者:
Antonios Varvitsiotis
中科院分区:
文献类型:
--
作者:
Samuel Fiorini;T. Huynh;G. Joret;Antonios Varvitsiotis
Let $G$ be a graph and $p in [1, infty]$. The parameter $f_p(G)$ is the least integer $k$ such that for all $m$ and all vectors $(r_v)_{v in V(G)} subseteq mathbb{R}^m$, there exist vectors $(q_v)_{v in V(G)} subseteq mathbb{R}^k$ satisfying $$|r_v-r_w|_p=|q_v-q_w|_p, ext{ for all } vwin E(G).$$ It is easy to check that $f_p(G)$ is always finite and that it is minor monotone. By the graph minor theorem of Robertson and Seymour, there are a finite number of excluded minors for the property $f_p(G) leq k$.
In this paper, we determine the complete set of excluded minors for $f_infty(G) leq 2$. The two excluded minors are the wheel on $5$ vertices and the graph obtained by gluing two copies of $K_4$ along an edge and then deleting that edge. We also show that the same two graphs are the complete set of excluded minors for $f_1(G) leq 2$. In addition, we give a family of examples that show that $f_infty$ is unbounded on the class of planar graphs and $f_infty$ is not bounded as a function of tree-width.
影响因子:
0.8
作者:
Kitson D
通讯作者:
Kitson D