首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The maximum number of Hamiltonian paths in tournaments
Authors:Alon  Noga
Institution:(1) Raymond and Beverly Sackler Faculty of Exact Sciences School of Mathematical Sciences, Tel Aviv University, Ramat Aviv, Tel-Aviv, Israel
Abstract:Solving an old conjecture of Szele we show that the maximum number of directed Hamiltonian paths in a tournament onn vertices is at mostc · n 3/2 · n!/2 n–1, wherec is a positive constant independent ofn.Research supported in part by a U.S.A.-Israel BSF grant and by a Bergmann Memorial Grant.
Keywords:05 C 20  05 C 35  05 C 38
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号