比赛中给定长度的路径

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A Pub Date : 2023-09-14 DOI:10.5070/c63261981

Sah, Ashwin, Sawhney, Mehtaab, Zhao, Yufei

引用次数: 1

摘要

作者:Sah, Ashwin;Sawhney, Mehtaab;摘要:我们证明了每个\(n\) -顶点比赛最多有\(n \left(\frac{n-1}{2} \right)^k\)条步道，步道长度为\(k\)。数学学科分类:05C38, 05d99关键词:路径，比赛

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

查看原文本刊更多论文

Paths of given length in tournaments

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

求助全文

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

来源期刊

Journal of Combinatorial Theory Series A 数学-数学

CiteScore

2.90

自引率

9.10%

发文量

审稿时长

12 months

期刊介绍： 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.