一组$t$-正则自互补$k$-超图

IF 0.6 Q3 MATHEMATICS Transactions on Combinatorics Pub Date : 2017-03-01 DOI:10.22108/TOC.2017.20363

M. Ariannejad, M. Emami, O. Naserian

{"title":"一组$t$-正则自互补$k$-超图","authors":"M. Ariannejad, M. Emami, O. Naserian","doi":"10.22108/TOC.2017.20363","DOIUrl":null,"url":null,"abstract":"We use the recursive method of construction large sets of t-designs given by Qiu-rong Wu (A note on extending t-designs‎, ‎{em Australas‎. ‎J‎. ‎Combin.}‎, ‎{bf 4} (1991) 229--235.), and present a similar method for constructing $t$-subset-regular‎ ‎self-complementary $k$-uniform hypergraphs of order $v$‎. ‎As an‎ ‎application we show the existence of a new family of 2-subset-regular‎ ‎self-complementary 4-uniform hypergraphs with $v=16m+3$‎.","PeriodicalId":43837,"journal":{"name":"Transactions on Combinatorics","volume":"6 1","pages":"39-46"},"PeriodicalIF":0.6000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A family of $t$-regular self-complementary $k$-hypergraphs\",\"authors\":\"M. Ariannejad, M. Emami, O. Naserian\",\"doi\":\"10.22108/TOC.2017.20363\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We use the recursive method of construction large sets of t-designs given by Qiu-rong Wu (A note on extending t-designs‎, ‎{em Australas‎. ‎J‎. ‎Combin.}‎, ‎{bf 4} (1991) 229--235.), and present a similar method for constructing $t$-subset-regular‎ ‎self-complementary $k$-uniform hypergraphs of order $v$‎. ‎As an‎ ‎application we show the existence of a new family of 2-subset-regular‎ ‎self-complementary 4-uniform hypergraphs with $v=16m+3$‎.\",\"PeriodicalId\":43837,\"journal\":{\"name\":\"Transactions on Combinatorics\",\"volume\":\"6 1\",\"pages\":\"39-46\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2017-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transactions on Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22108/TOC.2017.20363\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22108/TOC.2017.20363","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

利用吴秋荣给出的构造大集t-设计的递推方法（关于推广t-设计的注记‎, ‎｛em Australas‎. ‎J‎. ‎组合。｝‎, ‎{bf4}（1991）229-235.），并提出了构造$t$-子集正则的类似方法‎ ‎自补$k$-v阶一致超图$‎. ‎作为‎ ‎应用我们证明了一个新的2-亚正则族的存在‎ ‎$v=16m+3的自补4-一致超图$‎.

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A family of $t$-regular self-complementary $k$-hypergraphs

We use the recursive method of construction large sets of t-designs given by Qiu-rong Wu (A note on extending t-designs‎, ‎{em Australas‎. ‎J‎. ‎Combin.}‎, ‎{bf 4} (1991) 229--235.), and present a similar method for constructing $t$-subset-regular‎ ‎self-complementary $k$-uniform hypergraphs of order $v$‎. ‎As an‎ ‎application we show the existence of a new family of 2-subset-regular‎ ‎self-complementary 4-uniform hypergraphs with $v=16m+3$‎.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊