Premium
More proofs of menger's theorem
Author(s) -
NashWilliams C. St. J. A.,
Tutte W. T.
Publication year - 1977
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190010107
Subject(s) - digraph , mathematical proof , mathematics , combinatorics , robertson–seymour theorem , discrete mathematics , directed graph , graph , undirected graph , finite graph , pathwidth , line graph , geometry
Abstract Four ways of proving Menger's Theorem by induction are described. Two of them involve showing that the theorem holds for a finite undirected graph G if it holds for the graphs obtained from G by deleting and contracting the same edge. The other two prove the directed version of Menger's Theorem to be true for a finite digraph D if it is true for a digraph obtained by deleting an edge from D .