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.32801MaRDI QIDQ5551495
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
Polytopes, graphs, and complexes, Sets of Lattice Points which Contain a Maximal Number of Edges, Another generalization of the Kruskal-Katona theorem, Extremal problems for finite sets and convex hulls---a survey, The edge-isoperimetric problem on the 600-vertex regular solid, Yet another generalization of the Kruskal-Katona theorem, A novel algorithm on network reliability estimation, The optimal number of faces in cubical complexes