Prefer a chat interface with context about you and your work?
Extremal Edge Polytopes
The "edge polytope" of a finite graph $G$ is the convex hull of the columns of its vertex-edge incidence matrix. We study extremal problems for this class of polytopes. For $k =2, 3, 5$ we determine the maximal number of vertices of $k$-neighborly edge polytopes up to a sublinear term. …