The maximum diameter of pure simplicial complexes and pseudo-manifolds

DOI10.1016/j.endm.2016.09.038zbMath1356.05157arXiv1603.06238OpenAlexW2781112128MaRDI QIDQ5892298

Francisco Santos, Francisco Criado

Publication date: 13 February 2017

Published in: Electronic Notes in Discrete Mathematics, Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphdiametersimplicial complexpseudo-manifoldHirsch conjecturehyper-graph

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Hypergraphs (05C65) Distance in graphs (05C12) Combinatorial aspects of simplicial complexes (05E45)

Related Items

Diameters of cocircuit graphs of oriented matroids: an update, Hirsch polytopes with exponentially long combinatorial segments, On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes, Randomized construction of complexes with large diameter

Cites Work

• Recent progress on the combinatorial diameter of polytopes and simplicial complexes
• A counterexample to the Hirsch conjecture
• On the snake in the box problem
• Oriented Euler complexes and signed perfect matchings
• Polyhedral graph abstractions and an approach to the linear Hirsch conjecture
• Euler Complexes
• Diameter of Polyhedra: Limits of Abstraction
• A generalized complementary pivoting algorithm
• Unnamed Item
• Unnamed Item