Minimum Separators and Menger’s Theorem
| dc.contributor.author | El Joubbeh, Mouhamad | |
| dc.contributor.department | Department of Mathematics | |
| dc.contributor.faculty | Faculty of Arts and Sciences (FAS) | |
| dc.contributor.institution | American University of Beirut | |
| dc.date.accessioned | 2025-01-24T11:24:43Z | |
| dc.date.available | 2025-01-24T11:24:43Z | |
| dc.date.issued | 2023 | |
| dc.description.abstract | Menger’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.doi | https://doi.org/10.1007/s00373-023-02657-5 | |
| dc.identifier.eid | 2-s2.0-85159936990 | |
| dc.identifier.uri | http://hdl.handle.net/10938/26111 | |
| dc.language.iso | en | |
| dc.publisher | Springer | |
| dc.relation.ispartof | Graphs and Combinatorics | |
| dc.source | Scopus | |
| dc.subject | Connectivity | |
| dc.subject | Internally disjoint paths | |
| dc.subject | Menger’s theorem | |
| dc.subject | Minimum separators | |
| dc.title | Minimum Separators and Menger’s Theorem | |
| dc.type | Article |
Files
Original bundle
1 - 1 of 1