Un problème de connectivité sur les espaces métriques (Q801084): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank

Revision as of 14:58, 14 June 2024

scientific article
Language Label Description Also known as
English
Un problème de connectivité sur les espaces métriques
scientific article

    Statements

    Un problème de connectivité sur les espaces métriques (English)
    0 references
    1984
    0 references
    If x and y are two points of a compact metric space E, we call connectivity in E between x and y the smallest number of points other than x or y that we must withdraw from E in order to get a metric space which does not admit any continuous path between x and y. We denote this number by \(C_ E(x,y)\) and we prove, under some regularity conditions on E, that if \(C_ E(x,y)<\infty\), then there exists in E a system of \(C_ E(x,y)\) innerly disjoint continuous paths between x and y. This result provides us with an extension of Menger's theorem for finite graphs and we show how it may become incorrect when E presents some kinds of irregularities.
    0 references
    0 references
    connectivity between points
    0 references
    Menger's theorem
    0 references
    compact metric space
    0 references
    0 references

    Identifiers