偶阶凸几何图中简单Hamilton路的Blockers
Blockers for simple Hamiltonian paths in convex geometric graphs of even order
摘要：
设G是一个顶点数为2 m的完全凸几何图，F是G的一个子图族. F的一个Blocker是满足F的每个元素的一组尽可能小的边。在[C. Keller和M. A. Perles，关于凸几何图中阻塞简单完美匹配的最小集合，Israel J. Math. 187（2012），pp. 465-484]，我们给出了G.在本文中，我们表明，家庭的简单的哈密顿路径（SHP）在G中有完全相同的阻滞剂家庭的SPM。我们的论证相当简短，并为[KP 12]的结果提供了一个简单得多的证明。
英文摘要：
Let G be a complete convex geometric graph on 2m vertices, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that meets every element of F. In [C. Keller and M. A. Perles, On the smallest sets blocking simple perfect matchings in a convex geometric graph, Israel J. Math. 187 (2012), pp. 465-484], we gave an explicit description of all blockers for the family of simple perfect matchings (SPMs) of G. In this paper we show that the family of simple Hamiltonian paths (SHPs) in G has exactly the same blockers as the family of SPMs. Our argument is rather short, and provides a much simpler proof of the result of [KP12].
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
