{"title":"比赛中给定长度的路径","authors":"Sah, Ashwin, Sawhney, Mehtaab, Zhao, Yufei","doi":"10.5070/c63261981","DOIUrl":null,"url":null,"abstract":"Author(s): Sah, Ashwin; Sawhney, Mehtaab; Zhao, Yufei | Abstract: We prove that every \\(n\\)-vertex tournament has at most \\(n \\left(\\frac{n-1}{2} \\right)^k\\) walks of length \\(k\\).Mathematics Subject Classifications: 05C38, 05D99Keywords: Paths, tournaments","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Paths of given length in tournaments\",\"authors\":\"Sah, Ashwin, Sawhney, Mehtaab, Zhao, Yufei\",\"doi\":\"10.5070/c63261981\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Author(s): Sah, Ashwin; Sawhney, Mehtaab; Zhao, Yufei | Abstract: We prove that every \\\\(n\\\\)-vertex tournament has at most \\\\(n \\\\left(\\\\frac{n-1}{2} \\\\right)^k\\\\) walks of length \\\\(k\\\\).Mathematics Subject Classifications: 05C38, 05D99Keywords: Paths, tournaments\",\"PeriodicalId\":50230,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series A\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series A\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5070/c63261981\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5070/c63261981","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Author(s): Sah, Ashwin; Sawhney, Mehtaab; Zhao, Yufei | Abstract: We prove that every \(n\)-vertex tournament has at most \(n \left(\frac{n-1}{2} \right)^k\) walks of length \(k\).Mathematics Subject Classifications: 05C38, 05D99Keywords: Paths, tournaments
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
