论文标题
顶点传递图的演示文稿
Presentations for Vertex Transitive Graphs
论文作者
论文摘要
通过允许某些顶点遵守不同的关系，我们可以根据小组演示来概括Cayley图的标准构造。结果的概念使我们能够表示每个顶点及物图。作为中间步骤，我们证明，每个无限，连接的顶点及物图都具有完美的匹配。顺便说一句，我们构建了一个2端的立方顶点及物图的示例，该图不是Cayley图，回答了1990年的沃特金斯问题。
We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex transitive graph. As an intermediate step, we prove that every countably infinite, connected, vertex transitive graph has a perfect matching. Incidentally, we construct an example of a 2-ended cubic vertex transitive graph which is not a Cayley graph, answering a question of Watkins from 1990.
