Pages that link to "Item:Q2529023"
From MaRDI portal
The following pages link to The \(d\)-step conjecture for polyhedra of dimension \(d<6\) (Q2529023):
Displaying 50 items.
- Wedge operations and torus symmetries (Q286723) (← links)
- An analogue of the Klee-Walkup result for sonnevend's curvature of the central path (Q289062) (← links)
- Quadratic diameter bounds for dual network flow polyhedra (Q312672) (← links)
- The circuit diameter of the Klee-Walkup polyhedron (Q322311) (← links)
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- The Hirsch conjecture for the fractional stable set polytope (Q463733) (← links)
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
- One-point suspensions and wreath products of polytopes and spheres (Q556855) (← links)
- On Minkowski sums of simplices (Q659803) (← links)
- Polytopes and arrangements: diameter and curvature (Q935228) (← links)
- A continuous \(d\)-step conjecture for polytopes (Q1017920) (← links)
- Unions of oriented matroids (Q1053022) (← links)
- The minimum number of faces of a simple polyhedron (Q1147993) (← links)
- A family of neighborly polytopes (Q1157586) (← links)
- The number of faces of polytope pairs and unbounded polyhedra (Q1163744) (← links)
- Upper bounds for the diameter and height of graphs of convex polyhedra (Q1196197) (← links)
- An upper bound for the diameter of a polytope (Q1212692) (← links)
- Polytope pairs and their relationship to linear programming (Q1218333) (← links)
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n) (Q1235191) (← links)
- More polytopes meeting the conjectured Hirsch bound (Q1301832) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- Non-revisiting paths on surfaces with low genus (Q1379985) (← links)
- A structure theorem for pseudomanifolds (Q1584323) (← links)
- Hirsch polytopes with exponentially long combinatorial segments (Q1675265) (← links)
- On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
- Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count (Q1747995) (← links)
- On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes (Q1753029) (← links)
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
- A refinement of Todd's bound for the diameter of a polyhedron (Q1785425) (← links)
- Blending simple polytopes at faces (Q1877657) (← links)
- Nonrevisiting paths on surfaces (Q1913603) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- Diameters of cocircuit graphs of oriented matroids: an update (Q2121728) (← links)
- Distance between vertices of lattice polytopes (Q2174873) (← links)
- A proof of the strict monotone 5-step conjecture (Q2225660) (← links)
- Two combinatorial properties of a class of simplicial polytopes (Q2266229) (← links)
- An asymptotically improved upper bound on the diameter of polyhedra (Q2324633) (← links)
- Improving bounds on the diameter of a polyhedron in high dimensions (Q2359957) (← links)
- Connectivity and \(W_v\)-paths in polyhedral maps on surfaces (Q2408192) (← links)
- Polyhedral graph abstractions and an approach to the linear Hirsch conjecture (Q2436640) (← links)
- Buchstaber invariant theory of simplicial complexes and convex polytopes (Q2514587) (← links)
- Some upper bounds for the diameters of convex polytopes (Q2551973) (← links)
- Circuit walks in integral polyhedra (Q2673232) (← links)
- The diameter of the ridge-graph of a cyclic polytope (Q3225858) (← links)
- On the length of simplex paths: The assignment case (Q3698637) (← links)
- A proof of the maximal diameter conjecture for the transportation polyhedron (Q3738927) (← links)
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840) (← links)
- Adjacency on the Postman Polyhedron (Q3963041) (← links)
