The second neighborhood conjecture for oriented graphs missing a c4, c4,s3, chair and chair-free graph
Résumé
Seymour's Second Neighborhood Conjecture (SNC) asserts that every oriented graph has a vertex whose first out-neighborhood is at most as large as its second out-neighborhood. In this paper, we prove that if G is a graph containing no induced C4, C4¯¯¯¯¯¯, S3, chair and chair¯¯¯¯¯¯¯¯¯¯¯¯, then every oriented graph missing G satisfies this conjecture. As a consequence, we deduce that the conjecture holds for every oriented graph missing a threshold graph, a generalized comb or a star.
Domaines
Mathématiques [math]Origine | Fichiers produits par l'(les) auteur(s) |
---|