Zur allgemeinen Kurventheorie

Menger, K. (1927). Zur allgemeinen Kurventheorie. Fundamenta Mathematicae, 10, 96-115.

Type

Journal article

Intellectual base

Primary research

Year

1927

Link

https://eudml.org/doc/211191

Cited from

mathematics

Cited by

1 citation across 1 artifact.

Primes

• Cut
  • The cut supports several reusable inference patterns, each stated in terms of partitions and crossing edges rather than any substrate. Max-flow min-cut duality: the maximum sustainable s–t flow equals the minimum s–t cut capacity, a structural theorem connecting an optimization (maximize flow) with a partition problem (find the smallest separating edge set), and the same duality recurs in linear-programming duality and in matching/vertex-cover. Menger's theorem: the maximum number of disjoint paths between two vertices equals the minimum cut separating them, the same connectivity-versus-cut equality in another guise.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:8cfc8d105993 · see in the full table