{"title":"Existences of semiregular automorphisms of edge-transitive graphs of odd prime valency","authors":"Wenjuan Luo, Jing Xu","doi":"10.1016/j.jcta.2025.106117","DOIUrl":null,"url":null,"abstract":"<div><div>The Polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism whose cycles all have the same length. Similarly, in <span><span>[11]</span></span> the authors asked if every connected regular edge-transitive graph admits a semiregular automorphism. In this paper we prove that edge-transitive graphs of odd prime valency have a semiregular automorphism.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"218 ","pages":"Article 106117"},"PeriodicalIF":1.2000,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316525001128","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
The Polycirculant conjecture asserts that every vertex-transitive digraph has a semiregular automorphism whose cycles all have the same length. Similarly, in [11] the authors asked if every connected regular edge-transitive graph admits a semiregular automorphism. In this paper we prove that edge-transitive graphs of odd prime valency have a semiregular automorphism.
期刊介绍:
The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.