Pages that link to "Item:Q3769521"

The following pages link to The <i>d</i>-Step Conjecture and Its Relatives (Q3769521):

Displaying 50 items.

• Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
• A counterexample to the Hirsch conjecture (Q447933) (← links)
• One-point suspensions and wreath products of polytopes and spheres (Q556855) (← links)
• An update on the Hirsch conjecture (Q613104) (← links)
• On locally constructible spheres and balls (Q642118) (← links)
• Signature classes of transportation polytopes (Q689115) (← links)
• A generalization of a result of Dong and Santos-Sturmfels on the Alexander dual of spheres and balls (Q891830) (← links)
• Spherical complexes and nonprojective toric varieties (Q1079195) (← links)
• Many triangulated spheres (Q1094674) (← links)
• On the diameter of convex polytopes (Q1193432) (← links)
• An O(\(n\)) bound for the diameter of transshipment polytopes (Q1195869) (← links)
• Upper bounds for the diameter and height of graphs of convex polyhedra (Q1196197) (← links)
• Paths on polymatroids (Q1196722) (← links)
• The monotonic diameter of the perfect matching and shortest path polytopes (Q1200757) (← links)
• Equidecomposable and weakly neighborly polytopes (Q1261897) (← links)
• The monotonic diameter of traveling salesman polytopes (Q1271383) (← links)
• More polytopes meeting the conjectured Hirsch bound (Q1301832) (← links)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
• Shellability of chessboard complexes (Q1335149) (← links)
• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
• Lattice-free polytopes and their diameter (Q1346126) (← links)
• The \(d\)-step conjecture and Gaussian elimination (Q1361811) (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
• Non-revisiting paths on surfaces with low genus (Q1379985) (← links)
• Counterexamples to the strong \(d\)-step conjecture for \(d\geq 5\) (Q1380785) (← links)
• A structure theorem for pseudomanifolds (Q1584323) (← links)
• Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count (Q1747995) (← links)
• A refinement of Todd's bound for the diameter of a polyhedron (Q1785425) (← links)
• The Hirsch conjecture is true for (0,1)-polytopes (Q1825756) (← links)
• Adjacency on combinatorial polyhedra (Q1842660) (← links)
• Nonrevisiting paths on surfaces (Q1913603) (← links)
• On the circuit diameter conjecture (Q1991340) (← links)
• A construction of SKT manifolds using toric geometry (Q2024031) (← links)
• Diameters of cocircuit graphs of oriented matroids: an update (Q2121728) (← 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)
• Transportation problems and simplicial polytopes that are not weakly vertex-decomposable (Q2925352) (← links)
• Obstructions to weak decomposability for simplicial polytopes (Q3190213) (← links)
• A Minimal Irreducible Triangulation of $$\mathbb{S}^{3}$$ (Q3466819) (← links)
• Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840) (← links)
• On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes (Q3971327) (← links)
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra (Q4005821) (← links)
• How to make a triangulation of $S^3$ polytopal (Q4813860) (← links)
• Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets (Q4915386) (← links)
• The extension of step-N signatures (Q5101391) (← links)
• Vertex decomposability of complexes associated to forests (Q5103871) (← links)
• The width of five-dimensional prismatoids (Q5245200) (← links)
• The Hirsch Conjecture Holds for Normal Flag Complexes (Q5247624) (← links)
• The parameter space of the \(d\)-step conjecture (Q6567755) (← links)
• Complexity of the gravitational method for linear programming (Q6567772) (← links)