The maximum diameter of 2-dimensional simplicial complexes

DOI10.1007/S00454-026-00844-8MaRDI QIDQ7363882zbMATH OpenFDO

Authors O. Parczyk, Silas Rathke, Tibor Szabó

Publication date 1 October 2026

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00454-026-00844-8

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Cites work

• A counterexample to the Hirsch conjecture
• A proof of Ringel's conjecture
• Achromatic and harmonious colorings of circulant graphs
• Constructing optimal k-radius sequences
• Constructions of asymptotically shortest \(k\)-radius sequences
• Extremal aspects of graph and hypergraph decomposition problems
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• Packing spanning graphs from separable families
• Perfectly packing graphs with bounded degeneracy and many leaves
• Randomized construction of complexes with large diameter
• Recent progress on the combinatorial diameter of polytopes and simplicial complexes
• Resolution of the Oberwolfach problem
• Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
• Sequentially additive graphs
• The difference between consecutive primes in an arithmetic progression
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• The maximum diameter of pure simplicial complexes and pseudo-manifolds
• The wonderful Walecki construction

This page was built for publication: The maximum diameter of 2-dimensional simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363882)