The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
From MaRDI portal
Publication:5551495
DOI10.1016/S0021-9800(69)80109-2zbMath0165.32801OpenAlexW1976773834MaRDI QIDQ5551495
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80109-2
Related Items (10)
Another generalization of the Kruskal-Katona theorem ⋮ Extremal problems for finite sets and convex hulls---a survey ⋮ Polytopes, graphs, and complexes ⋮ The edge-isoperimetric problem on the 600-vertex regular solid ⋮ A practical bounding algorithm for computing two-terminal reliability based on decomposition technique ⋮ Sets of Lattice Points which Contain a Maximal Number of Edges ⋮ A novel algorithm on network reliability estimation ⋮ The optimal number of faces in cubical complexes ⋮ Yet another generalization of the Kruskal-Katona theorem ⋮ The filling problem in the cube
This page was built for publication: The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
