科研之友
微信
新浪微博
Facebook
分享链接
摘要
We conjecture that every oriented graph G on n vertices with delta(+)(G), delta(-)(G)=5n/12 contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfect packings of transitive tournaments is also considered.
- 出版日期2012-3
