On Seymour's second neighborhood conjecture of m-free digraphs

DOI10.1016/J.DISC.2017.04.003zbMATH Open1362.05053arXiv1701.00328OpenAlexW2568657929WikidataQ123189534 ScholiaQ123189534MaRDI QIDQ2397537FDOQ2397537

Authors: Hao Liang, Jun-Ming Xu 

Publication date: 22 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: This paper gives an approximate result related to Seymour's Second Neighborhood conjecture, that is, for any $m$-free digraph $G$, there exists a vertex $vinV(G)$ and a real number $lambd{a}_m$ such that $d^{++}(v)geqlambd{a}_m{d}^{+}(v)$, and $lambd{a}_{m}ightarrow1$ while $mightarrow+infty$. This result generalizes and improves some known results in a sense.

Full work available at URL: https://arxiv.org/abs/1701.00328

Recommendations

• Seymour's second neighborhood conjecture for \(m\)-free, \(k\)-transitive, \(k\)-anti-transitive digraphs and some approaches
• On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity
• scientific article
• scientific article; zbMATH DE number 7250391
• A note on Seymour's second neighborhood conjecture
• Seymour's second‐neighborhood conjecture from a different perspective
• Seymour's second neighborhood conjecture for 6-antitransitive digraphs
• Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs
• Seymour's second neighborhood conjecture for 5-anti-transitive oriented graphs

zbMATH Keywords

digraphdirected cycleSeymour's second neighborhood conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Second neighborhood via first neighborhood in digraphs
• The number of Seymour vertices in random tournaments and digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Remarks on the second neighborhood problem
• On directed triangles in digraphs
• On Iterated Image Size for Point-Symmetric Relations
• Minimum feedback arc set of \(m\)-free digraphs
• On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity

Cited In (5)

• 4-Free Strong Digraphs with the Maximum Size
• Title not available (Why is that?)
• Title not available (Why is that?)
• Seymour's second neighborhood conjecture for 5-anti-transitive oriented graphs
• Seymour's second neighborhood conjecture for \(m\)-free, \(k\)-transitive, \(k\)-anti-transitive digraphs and some approaches

This page was built for publication: On Seymour's second neighborhood conjecture of \(m\)-free digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397537)