Skip to main content
Log in

Minimally k-Edge-Connected Directed Graphs of Maximal Size

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

Let D=(V,E) be a minimally k-edge-connected simple directed graph. We prove that there is a function f(k) such that |V|≥f(k) implies |E|≤2k(|V|−k). We also determine the extremal graphs whose size attains this upper bound.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tibor Jordán.

Additional information

Basic Research in Computer Science, funded by the Danish National Research Foundation.

Supported by the MTA-ELTE Egerváry Research Group on Combinatorial Optimization, and the Hungarian Scientific Research Fund grant No. F034930, T037547, and FKFP grant No. 0143/2001. Part of this research was done when the second author visited BRICS, University of Aarhus, Denmark.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Berg, A., Jordán, T. Minimally k-Edge-Connected Directed Graphs of Maximal Size. Graphs and Combinatorics 21, 39–50 (2005). https://doi.org/10.1007/s00373-004-0588-6

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-004-0588-6

Keywords

Navigation