On the public citation graph
Maximum diameter of abstract polytopes
0 signed · 35 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02395040openalex-snapshot
The d-step conjecture for polyhedra of dimension d<6
inferredcites →https://doi.org/10.1007/bfb0121239openalex-snapshot
Existence of A-avoiding paths in abstract polytopes
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11496915_17openalex-snapshot
Jumping Doesn’t Help in Abstract Cubes
inferred← citeshttps://doi.org/10.1007/bf00939135openalex-snapshot
On the structure of the set bases of a degenerate point
inferred← citeshttps://doi.org/10.1007/bf01580244openalex-snapshot
A generalized complementary pivoting algorithm
inferred← citeshttps://doi.org/10.1007/bf01609004openalex-snapshot
Abstract polytopes and the hirsch conjecture
inferred← citeshttps://doi.org/10.1007/bfb0121237openalex-snapshot
Lower bounds for maximum diameters of polytopes
inferred← citeshttps://doi.org/10.1007/bfb0121239openalex-snapshot
Existence of A-avoiding paths in abstract polytopes
inferred← citeshttps://doi.org/10.1007/s00454-017-9888-5openalex-snapshot
The Maximum Diameter of Pure Simplicial Complexes and Pseudo-manifolds
inferred← citeshttps://doi.org/10.1007/s10107-012-0611-2openalex-snapshot
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture
inferred← citeshttps://doi.org/10.1007/s10107-016-1099-yopenalex-snapshot
Hirsch polytopes with exponentially long combinatorial segments
inferred← citeshttps://doi.org/10.1007/s11750-013-0295-7openalex-snapshot
Recent progress on the combinatorial diameter of polytopes and simplicial complexes
inferred← citeshttps://doi.org/10.1016/0024-3795(81)90098-7openalex-snapshot
Unions of oriented matroids
inferred← citeshttps://doi.org/10.1016/j.aim.2005.05.021openalex-snapshot
RANDOM EDGE can be exponential on abstract cubes
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.12.004openalex-snapshot
George Dantzig’s impact on the theory of computation
inferred← citeshttps://doi.org/10.1016/j.endm.2016.09.038openalex-snapshot
The maximum diameter of pure simplicial complexes and pseudo-manifolds
inferred← citeshttps://doi.org/10.1016/j.jcta.2004.09.009openalex-snapshot
One-point suspensions and wreath products of polytopes and spheres
inferred← citeshttps://doi.org/10.1016/j.jda.2017.04.004openalex-snapshot
A complexity analysis of Policy Iteration through combinatorial matrices arising from Unique Sink Orientations
inferred← citeshttps://doi.org/10.1109/focs.2004.56openalex-snapshot
Random Edge Can Be Exponential on Abstract Cubes
inferred← citeshttps://doi.org/10.1137/140962310openalex-snapshot
An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron
inferred← citeshttps://doi.org/10.1145/2462356.2462408openalex-snapshot
Recent progress on the combinatorial diameter of polyhedra and simplicial complexes
inferred← citeshttps://doi.org/10.1287/moor.1.1.89openalex-snapshot
Long Monotone Paths in Abstract Polytopes
inferred← citeshttps://doi.org/10.1287/moor.1100.0470openalex-snapshot
Diameter of Polyhedra: Limits of Abstraction
inferred← citeshttps://doi.org/10.1287/moor.12.4.718openalex-snapshot
The d-Step Conjecture and Its Relatives
inferred← citeshttps://doi.org/10.1287/moor.3.3.224openalex-snapshot
The Hirsch Conjecture Fails for Triangulated 27-Spheres
inferred← citeshttps://doi.org/10.1287/moor.5.4.576openalex-snapshot
Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
inferred← citeshttps://doi.org/10.1365/s13291-012-0055-xopenalex-snapshot
Foundations of Discrete Optimization: In Transition from Linear to Non-linear Models and Methods
inferred← citeshttps://doi.org/10.37236/9653openalex-snapshot
Diameters of Cocircuit Graphs of Oriented Matroids: An Update
inferred← citeshttps://doi.org/10.48550/arxiv.1006.2416openalex-snapshot
Geometric Combinatorics of Transportation Polytopes and the Behavior of the Simplex Method
inferred← citeshttps://doi.org/10.48550/arxiv.1203.1525openalex-snapshot
Constructing subset partition graphs with strong adjacency and end-point count properties
inferred← citeshttps://doi.org/10.48550/arxiv.1402.3579openalex-snapshot
An improved Kalai-Kleitman bound for the diameter of a polyhedron
inferred← citeshttps://doi.org/10.48550/arxiv.1611.07354openalex-snapshot
On the diameter of dual graphs of Stanley-Reisner rings with Serre $(S_2)$ property and Hirsch type bounds on abstractions of polytopes
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.