On the Origin of the n-Arc Theorem

Karl Menger
Additional contact information
Karl Menger: Illinois Institute of Technology

A chapter in Selecta Mathematica, 1981, pp 219-228 from Springer

Abstract: Abstract The object of this article is to describe how I came to conjecture and then prove the following theorem [6] whose variants have been the subject of recent interest (see, for example, [1, 2, 9]):Theorem. Let G be a graph with A and B two disjoint n-tuples of vertices. Then either G contains n pairwise disjoint AB-paths (each connecting a point of A and a point B) or there exists a set of less than n vertices that separates A and B.

Date: 1981
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7091-6110-4_18

Ordering information: This item can be ordered from
http://www.springer.com/9783709161104

DOI: 10.1007/978-3-7091-6110-4_18

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().