Abstract
We prove that every critically n-connected, finite digraph has a vertex of outdegree less than 2 n or a vertex of indegree less than 2 n, but there is not always a vertex of outdegree less than 2 n. This bound 2 n−1 for the minimum of the out- and indegrees is, in general, best possible and was conjectured by Y. O. Hamidoune (“Contribution à l'étude de la connectivité d'un graphe”, Thèse d'Etat, Paris, 1980). An immediate consequence is the main result of the author's previous work ( Arch. Math. 25, 1974, 107–112) that every minimally n-edge-connected, finite digraph has a vertex of indegree and outdegree n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.