Skip to main content
Article thumbnail
Location of Repository

On linkages in polytope graphs

By Axel Werner and Ronald F. Wotzlaw

Abstract

Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.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.DFG, GRK 1408, Methoden für diskrete Strukture

Topics: 510 Mathematik
Year: 2011
DOI identifier: 10.1515/advgeom.2011.015
OAI identifier: oai:depositonce.tu-berlin.de:11303/7193
Provided by: DepositOnce
Journal:

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.