Minimum Separators and Menger’s Theorem

dc.contributor.authorEl Joubbeh, Mouhamad
dc.contributor.departmentDepartment of Mathematics
dc.contributor.facultyFaculty of Arts and Sciences (FAS)
dc.contributor.institutionAmerican University of Beirut
dc.date.accessioned2025-01-24T11:24:43Z
dc.date.available2025-01-24T11:24:43Z
dc.date.issued2023
dc.description.abstractMenger’s theorem implies simply the following property: A minimum separator S of non-adjacent vertices u and v in a graph G remains a minimum uv-separator in G- e , for every e∈ E(G[ S] ) . In this paper, we prove the equivalence between Menger’s theorem and this property and so by given an elementary proof of it, we get a new proof of Menger’s theorem. © 2023, The Author(s), under exclusive licence to Springer Nature Japan KK, part of Springer Nature.
dc.identifier.doihttps://doi.org/10.1007/s00373-023-02657-5
dc.identifier.eid2-s2.0-85159936990
dc.identifier.urihttp://hdl.handle.net/10938/26111
dc.language.isoen
dc.publisherSpringer
dc.relation.ispartofGraphs and Combinatorics
dc.sourceScopus
dc.subjectConnectivity
dc.subjectInternally disjoint paths
dc.subjectMenger’s theorem
dc.subjectMinimum separators
dc.titleMinimum Separators and Menger’s Theorem
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2023-800.pdf
Size:
189.63 KB
Format:
Adobe Portable Document Format