Disjoint edge paths between given vertices of a convex polytope (Q1062071): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Steve Gallivan / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Frank Plastria / rank
 
Normal rank

Revision as of 02:53, 10 February 2024

scientific article
Language Label Description Also known as
English
Disjoint edge paths between given vertices of a convex polytope
scientific article

    Statements

    Disjoint edge paths between given vertices of a convex polytope (English)
    0 references
    1985
    0 references
    For a graph G define r(G) to be the maximum number of pairs of different vertices from G such that there exist disjoint paths joining each pair. Let r(d) be the minimum of r(G) where G ranges over the graphs of all d- polytopes. It was shown by \textit{D. G. Larman} and \textit{P. Mani} [Proc. Lond. Math. Soc., III. Ser. 20, 144-160 (1970; Zbl 0201.568)] that \(r(d)\geq [(d+1)/3]\). In this paper a family of polytopes is constructed, by way of Gale diagrams, showing that \(r(d)\leq [(2d+3)/5].\) It is unknown whether this result is sharp for \(d>5\).
    0 references
    0 references
    0 references
    0 references
    0 references
    disjoint edge paths
    0 references
    convex polytopes
    0 references
    0 references