{"title":"自同构群有Zp为交换子群的传递图的哈密性","authors":"Florian Lehner , Farzad Maghsoudi , Babak Miraftab","doi":"10.1016/j.disc.2025.114798","DOIUrl":null,"url":null,"abstract":"<div><div>In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize this result to a broader class of infinite graphs <em>X</em>, where the automorphism group of <em>X</em> contains a transitive subgroup <em>G</em> with a cyclic commutator subgroup of prime order.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"349 3","pages":"Article 114798"},"PeriodicalIF":0.7000,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hamiltonicity of transitive graphs whose automorphism group has Zp as commutator subgroups\",\"authors\":\"Florian Lehner , Farzad Maghsoudi , Babak Miraftab\",\"doi\":\"10.1016/j.disc.2025.114798\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize this result to a broader class of infinite graphs <em>X</em>, where the automorphism group of <em>X</em> contains a transitive subgroup <em>G</em> with a cyclic commutator subgroup of prime order.</div></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":\"349 3\",\"pages\":\"Article 114798\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2025-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X25004066\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25004066","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Hamiltonicity of transitive graphs whose automorphism group has Zp as commutator subgroups
In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize this result to a broader class of infinite graphs X, where the automorphism group of X contains a transitive subgroup G with a cyclic commutator subgroup of prime order.
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.