科研之友
微信
新浪微博
Facebook
分享链接
摘要
Seymour%26apos;s Second Neighborhood Conjecture asserts that every oriented graph (without digons) has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. It is proved for tournaments, tournaments missing a matching and tournaments missing a generalized star. We prove this conjecture for classes of oriented graphs whose missing graph is a comb, a complete graph minus two independent edges, or a cycle of length 5.
- 出版日期2013-9
