On Seymour's second neighborhood conjecture of m-free digraphs
From MaRDI portal
Publication:2397537
Abstract: This paper gives an approximate result related to Seymour's Second Neighborhood conjecture, that is, for any -free digraph , there exists a vertex and a real number such that , and while . This result generalizes and improves some known results in a sense.
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; zbMATH DE number 7234604
- 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
Cites work
- scientific article; zbMATH DE number 1185310 (Why is no real title available?)
- scientific article; zbMATH DE number 1743979 (Why is no real title available?)
- scientific article; zbMATH DE number 927068 (Why is no real title available?)
- Minimum feedback arc set of \(m\)-free digraphs
- On directed triangles in digraphs
- On Iterated Image Size for Point-Symmetric Relations
- On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity
- Remarks on the second neighborhood problem
- Second neighborhood via first neighborhood in digraphs
- The number of Seymour vertices in random tournaments and digraphs
Cited in
(9)- 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
- Minimum feedback arc set of \(m\)-free digraphs
- scientific article; zbMATH DE number 7234604 (Why is no real title available?)
- scientific article; zbMATH DE number 7250391 (Why is no real title available?)
- 4-Free Strong Digraphs with the Maximum Size
- Seymour's second neighborhood conjecture for line digraph of digraph and its jump digraph
- A note on the second neighborhood problem
- A note on the second neighborhood problem for k-anti-transitive digraphs with large girth
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)