Polytopes with few vertices and few facets (Q285070): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Counting \(d\)-polytopes with \(d+3\) vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4309961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inner illumination of convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Positive 2-Spanning Sets of Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gale diagrams of convex polytopes and positive spanning sets of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many neighborly polytopes and oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborly polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3116025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lost Counterexample and a Problem on Illuminated Polytopes / rank
 
Normal rank

Revision as of 23:56, 11 July 2024

scientific article
Language Label Description Also known as
English
Polytopes with few vertices and few facets
scientific article

    Statements

    Polytopes with few vertices and few facets (English)
    0 references
    0 references
    18 May 2016
    0 references
    convex polytopes
    0 references
    number of combinatorial types
    0 references
    Perles' Skeleton theorem
    0 references

    Identifiers