Linkages in Polytope Graphs

Simple item page
dc.creatorWerner, Axel
dc.creatorWotzlaw, Ronald F.
dc.date2007-10-19
dc.date.accessioned2026-07-07T08:37:21Z
dc.date.available2026-07-07T08:37:21Z
dc.descriptionA graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional polytopes. We analyze in detail linkedness of polytopes on at most (6d+7)/5 vertices. In that case, a sharp 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.
dc.description14 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0710.3726
dc.identifierhttp://arxiv.org/abs/0710.3726
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140373
dc.subjectCombinatorics
dc.subject52B05; 05C38
dc.titleLinkages in Polytope Graphs
dc.typetext

Files

Collections

arXiv