arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.0555cs.CG
收藏

关于树和路不具有几何同时嵌入

On a Tree and a Path with no Geometric Simultaneous Embedding

Patrizio Angelini, Markus Geyer, Michael Kaufmann, Daniel Neuwirth

摘要:

两个图$G_1=(V,E_1)$和$G_2=(V,E_2)$允许几何同时嵌入,如果存在一组点P和一个双射M:P -> V,它们诱导$G_1$和$G_2$的平面直线嵌入。虽然它是已知的,两个毛毛虫总是承认一个几何同时嵌入,两棵树并不总是承认一个,关于树和路径的问题仍然是开放的,往往被认为是最突出的开放问题在这方面。我们通过提供一个反例来否定地回答这个问题。此外,由于反例使用两个图的不相交的边集,我们还否定地回答了另一个开放的问题,即是否有可能同时嵌入两个边不相交的树。作为最后的结果,我们研究了同样的问题时,对树施加一些限制。也就是说,我们表明,树的深度2和路径总是承认几何同时嵌入。事实上,这样一个强约束并没有缩小与不允许任何解的实例之间的差距,因为我们的反例中使用的树的深度为4。

英文摘要:

Two graphs $G_1=(V,E_1)$ and $G_2=(V,E_2)$ admit a geometric simultaneous embedding if there exists a set of points P and a bijection M: P -> V that induce planar straight-line embeddings both for $G_1$ and for $G_2$. While it is known that two caterpillars always admit a geometric simultaneous embedding and that two trees not always admit one, the question about a tree and a path is still open and is often regarded as the most prominent open problem in this area. We answer this question in the negative by providing a counterexample. Additionally, since the counterexample uses disjoint edge sets for the two graphs, we also negatively answer another open question, that is, whether it is possible to simultaneously embed two edge-disjoint trees. As a final result, we study the same problem when some constraints on the tree are imposed. Namely, we show that a tree of depth 2 and a path always admit a geometric simultaneous embedding. In fact, such a strong constraint is not so far from closing the gap with the instances not admitting any solution, as the tree used in our counterexample has depth 4.

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

↑