Home Mathematics On linkages in polytope graphs
Article
Licensed
Unlicensed Requires Authentication

On linkages in polytope graphs

  • EMAIL logo and
Published/Copyright: June 9, 2011
Become an author with De Gruyter Brill
Advances in Geometry
From the journal Volume 11 Issue 3

Abstract

A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We slightly improve a lower bound on the linkedness of polytopes. This results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional polytopes.

We analyze in detail linkedness of d-polytopes on at most (6d + 7)/5 vertices. In that case, a tight lower bound on minimal linkedness is derived, and examples meeting this lower bound are constructed. These examples contain a class of examples due to Gallivan.

Received: 2009-04-14
Revised: 2009-07-28
Published Online: 2011-06-09
Published in Print: 2011-July

© de Gruyter 2011

Downloaded on 1.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/advgeom.2011.015/html
Scroll to top button