Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts

Abstract : We study the number of inclusion-minimal cuts in an undi-rected connected graph G, also called st-cuts, for any two distinct nodes s and t: the st-cuts are in one-to-one correspondence with the partitions $S ∪ T$ of the nodes of G such that $S ∩ T = ∅, s ∈ S, t ∈ T$ , and the sub-graphs induced by S and T are connected. It is easy to find an exponential upper bound to the number of st-cuts (e.g. if G is a clique) and a constant lower bound. We prove that there is a more interesting lower bound on this number, namely, $Ω(m$), for undirected m-edge graphs that are biconnected or triconnected (2-or 3-node-connected). The wheel graphs show that this lower bound is the best possible asymptotically.
Document type :
Conference papers
Liste complète des métadonnées

Contributor : Marie-France Sagot <>
Submitted on : Sunday, December 23, 2018 - 12:22:34 PM
Last modification on : Tuesday, February 26, 2019 - 10:54:02 AM
Document(s) archivé(s) le : Sunday, March 24, 2019 - 1:30:59 PM


Files produced by the author(s)




Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, et al.. Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG 2018 - International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2018, Cottbus, Germany. pp.100-110, ⟨10.1007/978-3-030-00256-5_9⟩. ⟨hal-01964710⟩



Record views


Files downloads