About the second neighborhood problem in tournaments missing disjoint stars
Let $D$ be a digraph without digons. Seymour's second neighborhood conjecture states that $D$ has a vertex $v$ such that $d^+(v) \leq d^{++}(v)$. Under some conditions, we prove this conjecture for digraphs missing $n$ disjoint stars. Weaker conditions are required when $n = 2$ or $3$. In some...
Saved in:
Main Author: | |
---|---|
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2016-10-08.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |