Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count

DOI10.1007/s00493-016-3327-8zbMath1399.05029arXiv1409.7133OpenAlexW2268781411MaRDI QIDQ1747995

Tristram C. Bogart, Edward D. Kim

Publication date: 27 April 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.7133

zbMATH Keywords

dimension reductiondiameterpolytopeendpoint countstrong adjacencysuperlinear subset partition

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Linear programming (90C05) Distance in graphs (05C12) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recent progress on the combinatorial diameter of polytopes and simplicial complexes
• A counterexample to the Hirsch conjecture
• An update on the Hirsch conjecture
• Intersection homology theory
• Upper bounds for the diameter and height of graphs of convex polyhedra
• An upper bound for the diameter of a polytope
• The tail of the hypergeometric distribution
• Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• Face numbers of pseudomanifolds with isolated singularities
• Diameter of Polyhedra: Limits of Abstraction
• The graph of an abstract polytope
• The d-Step Conjecture and Its Relatives
• Long Monotone Paths in Abstract Polytopes
• A quasi-polynomial bound for the diameter\\of graphs of polyhedra
• Abstract polytopes and the hirsch conjecture
• The width of five-dimensional prismatoids
• An Improved Kalai--Kleitman Bound for the Diameter of a Polyhedron
• Probability Inequalities for Sums of Bounded Random Variables
• Wv paths on 3-polytopes
• Paths on Polytopes
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes