The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
From MaRDI portal
Publication:2529023
DOI10.1007/BF02395040zbMath0163.16801WikidataQ29305167 ScholiaQ29305167MaRDI QIDQ2529023
Publication date: 1967
Published in: Acta Mathematica (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Paths and cycles (05C38)
Related Items
On the length of simplex paths: The assignment case, Adjacency on the Postman Polyhedron, Diameters of cocircuit graphs of oriented matroids: an update, Improving bounds on the diameter of a polyhedron in high dimensions, Blending simple polytopes at faces, Wedge operations and torus symmetries, An analogue of the Klee-Walkup result for sonnevend's curvature of the central path, Quadratic diameter bounds for dual network flow polyhedra, More bounds on the diameters of convex polytopes, Diameter and Curvature: Intriguing Analogies, The circuit diameter of the Klee-Walkup polyhedron, Linear programming, the simplex algorithm and simple polytopes, A proof of the maximal diameter conjecture for the transportation polyhedron, Polytopes, graphs, and complexes, A quasi-polynomial bound for the diameter\\of graphs of polyhedra, Nonrevisiting paths on surfaces, Distance between vertices of lattice polytopes, Non-revisiting paths on surfaces with low genus, Connectivity and \(W_v\)-paths in polyhedral maps on surfaces, Hirsch polytopes with exponentially long combinatorial segments, The Excess Degree of a Polytope, Recent progress on the combinatorial diameter of polytopes and simplicial complexes, Topological Prismatoids and Small Simplicial Spheres of Large Diameter, Circuit walks in integral polyhedra, The diameter of the ridge-graph of a cyclic polytope, Primitive point packing, The minimum number of faces of a simple polyhedron, On the Combinatorial Diameters of Parallel and Series Connections, Transportation problems which can be solved by the use of hirsch-paths for the dual problems, A family of neighborly polytopes, Polyhedral graph abstractions and an approach to the linear Hirsch conjecture, A counterexample to the Hirsch conjecture, The number of faces of polytope pairs and unbounded polyhedra, The Hirsch conjecture for the fractional stable set polytope, On Minkowski sums of simplices, A proof of the strict monotone 5-step conjecture, Polytopes and arrangements: diameter and curvature, On sub-determinants and the diameter of polyhedra, A \(d\)-step approach to the maximum number of distinct squares and runs in strings, Constructing Clustering Transformations, On Dantzig figures from graded lexicographic orders, On the Circuit Diameter of Some Combinatorial Polytopes, Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count, Upper bounds for the diameter and height of graphs of convex polyhedra, On the circuit diameter conjecture, Bannai et al. method proves the \(d\)-step conjecture for strings, On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes, Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets, An upper bound for the diameter of a polytope, Polytope pairs and their relationship to linear programming, Two combinatorial properties of a class of simplicial polytopes, One-point suspensions and wreath products of polytopes and spheres, Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n), The diameters of network-flow polytopes satisfy the Hirsch conjecture, A refinement of Todd's bound for the diameter of a polyhedron, Abstract polytopes and the hirsch conjecture, Buchstaber invariant theory of simplicial complexes and convex polytopes, Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes, A continuous \(d\)-step conjecture for polytopes, Some upper bounds for the diameters of convex polytopes, An asymptotically improved upper bound on the diameter of polyhedra, The width of five-dimensional prismatoids, The Hirsch Conjecture Holds for Normal Flag Complexes, A structure theorem for pseudomanifolds, Unions of oriented matroids, More polytopes meeting the conjectured Hirsch bound
Cites Work
- Unnamed Item
- Unnamed Item
- On the graph structure of convex polyhedra in \(n\)-space
- Some semicontinuity theorems for convex polytopes and cell-complexes
- Longest Simple Paths in Polyhedral Graphs
- On The Number of Faces of a Convex Polytope
- On the Number of Vertices of a Convex Polytope
- Paths on Polyhedra. I
- Diameters of Polyhedral Graphs
