A note on the second neighborhood problem for $k$-anti-transitive and $m$-free digraphs
Abstract: Seymour Second Neighborhood Conjecture (SSNC) asserts that every finite oriented graph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood. Such a vertex is called a Seymour vertex. A digraph $D = (V, E)$ is $k$-anti-transitive if for every pair of vertices $u, v \in V$, the existence of a directed path of length $k$ from $u$ to $v$ implies that $(u, v) \notin E$. An $m$-free digraph is digraph having no directed cycles with length at most $m$. In this paper, we prove that if $D$ is $k$-anti-transitive and $(k-4)$-free digraph, then $D$ has a Seymour vertex. As a consequence, a special case of Caccetta-Haggkvist Conjecture holds on 7-anti-transitive oriented graphs. This work extends recently known results.
- The second neighborhood conjecture for oriented graphs missing a {C4,C4¯,S3,chairandchair¯}subscript𝐶4¯subscript𝐶4subscript𝑆3𝑐ℎ𝑎𝑖𝑟𝑎𝑛𝑑¯𝑐ℎ𝑎𝑖𝑟\{C_{4},\overline{C_{4}},S_{3},\ chair\ and\ \overline{chair}\}{ italic_C start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT , over¯ start_ARG italic_C start_POSTSUBSCRIPT 4 end_POSTSUBSCRIPT end_ARG , italic_S start_POSTSUBSCRIPT 3 end_POSTSUBSCRIPT , italic_c italic_h italic_a italic_i italic_r italic_a italic_n italic_d over¯ start_ARG italic_c italic_h italic_a italic_i italic_r end_ARG }-free graph. Australasian Journal of Combinatorics, 81(1):58–88, 2021.
- Contributions to seymour’s second neighborhood conjecture. Involve, a Journal of Mathematics, 2(4):387–395, 2009.
- On minimal digraphs with given girth. In Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing, congress. Numer., XXI, page 181–187, Winnipeg, Man., 1978. Utilitas Math.
- Second neighborhood via first neighborhood in digraphs. Annals of combinatorics, 7(1):15–20, 2003.
- Moussa Daamouch. Seymour’s second neighborhood conjecture for 5-anti-transitive oriented graphs. Discrete Applied Mathematics, 285:454–457, 2020.
- Moussa Daamouch. Seymour’s second neighborhood conjecture for some oriented graphs with no sink. Discrete Mathematics Letters, 4:19–22, 2020.
- Moussa Daamouch. Seymour’s second neighborhood conjecture for m𝑚mitalic_m-free, k𝑘kitalic_k-transitive, k𝑘kitalic_k-anti-transitive digraphs and some approaches. Discrete Applied Mathematics, 304:332–341, 2021.
- Moussa Daamouch. Strong k𝑘kitalic_k-transitive oriented graphs with large minimum degree. Communications in Combinatorics and Optimization, 2024. In Press.
- About the second neighborhood conjecture for tournaments missing two stars or disjoint paths. Submitted.
- Extending some results on the second neighborhood conjecture. Discrete Applied Mathematics, 311:1–17, 2022.
- Remarks on the second neighborhood problem. Journal of Graph Theory, 55(3):208–220, 2007.
- David C Fisher. Squaring a tournament: a proof of dean’s conjecture. Journal of Graph Theory, 23(1):43–48, 1996.
- Some results on 4-transitive digraphs. Discussiones Mathematicae: Graph Theory, 37(1), 2017.
- Salman Ghazal. Seymour’s second neighborhood conjecture for tournaments missing a generalized star. Journal of Graph Theory, 71(1):89–94, 2012.
- Salman Ghazal. A contribution to the second neighborhood problem. Graphs and Combinatorics, 29(5):1365–1375, 2013.
- Salman Ghazal. A remark on the second neighborhood problem. Electronic Journal of Graph Theory and Applications, 3(2), 2015.
- Seymour’s second neighbourhood conjecture for quasi-transitive oriented graphs. arXiv preprint arXiv:1704.01389, 2017.
- Seymour’s second neighborhood conjecture for 6-antitransitive digraphs. Discrete Applied Mathematics, 292:59–63, 2021.
- Median orders of tournaments: a tool for the second neighborhood problem and sumner’s conjecture. Journal of Graph Theory, 35(4):244–256, 2000.
- k𝑘kitalic_k-kernels in k𝑘kitalic_k-transitive and k𝑘kitalic_k-quasi-transitive digraphs. Discrete Mathematics, 312(16):2522–2530, 2012.
- The minimum degree approach for paul seymour’s distance 2 conjecture. Congressus Numerantium, pages 201–206, 2001.
- On seymour’s second neighborhood conjecture of m𝑚mitalic_m-free digraphs. Discrete Mathematics, 340(8):1944–1949, 2017.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.