Seymour's Second Neighborhood in 3-Free Digraphs
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{AAM-35-357,
author = {Chen , Bin and Chang , An},
title = {Seymour's Second Neighborhood in 3-Free Digraphs},
journal = {Annals of Applied Mathematics},
year = {2020},
volume = {35},
number = {4},
pages = {357--363},
abstract = {
In this paper, we consider Seymour's Second Neighborhood Conjecture in 3-free digraphs, and prove that for any 3-free digraph $D$, there exists a vertex say $v$, such that $d$++($v$) ≥ $⌊λd^+(v)⌋$, $λ$ = 0.6958 · · · . This slightly improves the known results in 3-free digraphs with large minimum out-degree.
}, issn = {}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/aam/18086.html} }
TY - JOUR
T1 - Seymour's Second Neighborhood in 3-Free Digraphs
AU - Chen , Bin
AU - Chang , An
JO - Annals of Applied Mathematics
VL - 4
SP - 357
EP - 363
PY - 2020
DA - 2020/08
SN - 35
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/aam/18086.html
KW - Seymour's second neighborhood conjecture, 3-free digraph.
AB -
In this paper, we consider Seymour's Second Neighborhood Conjecture in 3-free digraphs, and prove that for any 3-free digraph $D$, there exists a vertex say $v$, such that $d$++($v$) ≥ $⌊λd^+(v)⌋$, $λ$ = 0.6958 · · · . This slightly improves the known results in 3-free digraphs with large minimum out-degree.
BinChen & AnChang. (2020). Seymour's Second Neighborhood in 3-Free Digraphs.
Annals of Applied Mathematics. 35 (4).
357-363.
doi:
Copy to clipboard