On the order of semiregular automorphisms of cubic vertex-transitive graphs

IF 1 3区 数学 Q1 MATHEMATICS
Marco Barbieri , Valentina Grazian , Pablo Spiga
{"title":"On the order of semiregular automorphisms of cubic vertex-transitive graphs","authors":"Marco Barbieri ,&nbsp;Valentina Grazian ,&nbsp;Pablo Spiga","doi":"10.1016/j.ejc.2024.104091","DOIUrl":null,"url":null,"abstract":"<div><div>We prove that, if <span><math><mi>Γ</mi></math></span> is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of <span><math><mi>Γ</mi></math></span> of order at least 6, or the number of vertices of <span><math><mi>Γ</mi></math></span> is bounded above by an absolute constant.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"124 ","pages":"Article 104091"},"PeriodicalIF":1.0000,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669824001768","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We prove that, if Γ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of Γ of order at least 6, or the number of vertices of Γ is bounded above by an absolute constant.
论立方顶点变换图的半圆自动形的阶数
我们证明,如果 Γ 是一个有限连接的立方顶点传递图,那么要么存在阶数至少为 6 的 Γ 的半圆自动形,要么 Γ 的顶点数在上面以一个绝对常数为界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.10
自引率
10.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信