The minimum number of faces of a simple polyhedron (Q1147993): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A proof of the lower bound conjecture for convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shellings of spheres and polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of primal and dual methods of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytope pairs and their relationship to linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(d\)-step conjecture for polyhedra of dimension \(d<6\) / rank
 
Normal rank

Revision as of 10:10, 13 June 2024

scientific article
Language Label Description Also known as
English
The minimum number of faces of a simple polyhedron
scientific article

    Statements

    The minimum number of faces of a simple polyhedron (English)
    0 references
    1980
    0 references
    number of faces
    0 references
    simple d-polyhedron
    0 references
    0 references

    Identifiers