Neighborly polytope
id:
neighborly-polytope-283-14202536
title:
Neighborly polytope
text:
In geometry and polyhedral combinatorics, a k-neighborly polytope is a convex polytope in which every set of k or fewer vertices forms a face. For instance, a 2-neighborly polytope is a polytope in which every pair of vertices is connected by an edge, forming a complete graph. 2-neighborly polytopes with more than four vertices may exist only in spaces of four or more dimensions, and in general a k-neighborly polytope requires a dimension of 2k or more. A d-simplex is d-neighborly. A polytope is
brand slug:
wiki
category slug:
encyclopedia
description:
Convex polytope where all sets of ≤ k vertices form a face
original url:
https://en.wikipedia.org/wiki/Neighborly_polytope
date created:
date modified:
2023-10-03T18:15:14Z
main entity:
{"identifier":"Q17099348","url":"https://www.wikidata.org/entity/Q17099348"}
image:
fields total:
13
integrity:
14