{"title":"Extending Potočnik and Šajna’s Conditions on the Existence of Vertex-Transitive Self-Complementary k-Hypergraphs","authors":"L. Lesniak, Henri Thuiller, A. Wojda","doi":"10.7151/dmgt.2360","DOIUrl":null,"url":null,"abstract":"Abstract Let ℓ be a positive integer, k = 2ℓ or k = 2ℓ + 1, and let n be a positive integer with n ≡ 1 (mod 2ℓ+1). For a prime p, n(p) denotes the largest integer i such that pi divides n. Potočnik and Šajna showed that if there exists a vertex-transitive self-complementary k-hypergraph of order n, then for every prime p we have pn(p) ≡ 1 (mod 2ℓ+1). Here we extend their result to a larger class of integers k.","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2022-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discussiones Mathematicae Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.7151/dmgt.2360","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract Let ℓ be a positive integer, k = 2ℓ or k = 2ℓ + 1, and let n be a positive integer with n ≡ 1 (mod 2ℓ+1). For a prime p, n(p) denotes the largest integer i such that pi divides n. Potočnik and Šajna showed that if there exists a vertex-transitive self-complementary k-hypergraph of order n, then for every prime p we have pn(p) ≡ 1 (mod 2ℓ+1). Here we extend their result to a larger class of integers k.
期刊介绍:
The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.