arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.1793math.CO
收藏

不存在有限$5$ -正则火柴棒图

No finite $5$-regular matchstick graph exists

Sascha Kurz

摘要:

一个图$G=(V,E)$称为平面中的单位距离图,如果存在$V$在平面中的一个内射嵌入,使得每对邻顶点相距单位距离.如果另外对应的边是不相交的,并且所有的顶点都有相同的度$r$,我们称之为正则火柴棒图。由于欧拉多面体公式,我们有$r\le 5$。已知的最小$4$ -正则火柴棒图是由$52$顶点组成的Harborth图.本文证明了不存在有限$5$ -正则火柴棒图。

英文摘要:

A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are non-crossing and all vertices have the same degree $r$ we talk of a regular matchstick graph. Due to Euler's polyhedron formula we have $r\le 5$. The smallest known $4$-regular matchstick graph is the so called Harborth graph consisting of $52$ vertices. In this article we prove that no finite $5$-regular matchstick graph exists.

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

↑