Mathematics – Combinatorics
Scientific paper
2011-06-27
Mathematics
Combinatorics
Scientific paper
Seymour's Second Neighborhood Conjecture asserts that every digraph (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 digraphs whose missing graph is a comb, a complete graph minus 2 independent edges, or a complete graph minus the edges of a cycle of length 5.
No associations
LandOfFree
A contribution to the second neighborhood problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A contribution to the second neighborhood problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A contribution to the second neighborhood problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-639057