We study the graph of vertices and edges of a polytope. A graph is t-linked if for any 2t vertices x1,…xt,y1,…,yt there exists t disjoint paths from xi to yi, i=1,…,t. We investigate the connection between dimension of the polytope and linkage of the graph, for some families of polytopes.
|Effective start/end date||01/01/2018 → …|
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.