On the Number of 5-Cycles in a Tournament
Author:
Affiliation:
1. DEPARTMENTS OF MATHEMATICS, COMPUTER SCIENCES, AND STATISTICS; ST. LAWRENCE UNIVERSITY; CANTON NY 13617
2. DEPARTMENT OF MATHEMATICS; CARNEGIE MELLON UNIVERSITY; PITTSBURGH PA 15213
Publisher
Wiley
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Link
http://onlinelibrary.wiley.com/wol1/doi/10.1002/jgt.22130/fullpdf
Reference17 articles.
1. The maximum number of strongly connected subtournaments;Beineke;Canad Math Bull,1965
2. David M. Berman On the number of 5-cycles in a tournament, Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing 1975
3. D. M. Berman The Number of 5-cycles in a Tournament 1973
4. On the Ramsey multiplicities of graph problems and recent results;Burr;J Graph Theory,1980
Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quasirandom-Forcing Orientations of Cycles;SIAM Journal on Discrete Mathematics;2023-11-14
2. Cycles of a given length in tournaments;Journal of Combinatorial Theory, Series B;2023-01
3. Compact Symmetry Breaking for Tournaments;Form Comp Aid Design;2022
4. Bounds on the Number of Compatible k-Simplices Matching the Orientation of the (k − 1)-Skeleton of a Simplex;Combinatorica;2021-04
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3