至多一个二重复盖,每个正则连通图同构于一个Schreier图
组合数学
2024-03-21 v2 群论
摘要
我们证明每个连通局部有限正则图都有一个二重复盖,其同构于一个Schreier图。
引用
@article{arxiv.2010.06431,
title = {Up to a double cover, every regular connected graph is isomorphic to a Schreier graph},
author = {Paul-Henry Leemann},
journal= {arXiv preprint arXiv:2010.06431},
year = {2024}
}
备注
6 pages, 2 figures. V2: Final version, to appear in Bulletin of the Belgian Mathematical Society - Simon Stevin