Skip to main content

All Questions

Filter by
Sorted by
Tagged with
22 votes
4 answers
3k views

Can you determine whether a graph is the 1-skeleton of a polytope?

How do I test whether a given undirected graph is the 1-skeleton of a polytope? How can I tell the dimension of a given 1-skeleton?
Hans-Peter Stricker's user avatar
16 votes
3 answers
720 views

Can we realize a graph as the skeleton of a polytope that has the same symmetries?

Given a graph $G$, a realization of $G$ as a polytope is a convex polytope $P\subseteq \Bbb R^n$ with $G$ as its 1-skeleton. A realization $P\subseteq \Bbb R^n$ is said to realize the symmetries of $...
M. Winter's user avatar
  • 13.6k
4 votes
0 answers
282 views

Prove or disprove a claim about covering a polytope by convex polytopes in a certain way

Here is the claim: Given a polytope $K$ in a unit ball in $\mathbb{R}^d$, there exists a universal constant $C(d)>0$ depending only on $d$ and a countable collection of convex polytopes $\{K_i\}_{...
student's user avatar
  • 1,350
3 votes
3 answers
390 views

Can we uniquely define a graph to have the topology of a polytope via proper edge length selection?

I'll ask you to consider a situation wherein one has a series of edges for a graph, $(e_1, e_2, ..., e_N) \in E$, each with a specifiable length $(l_1, l_2, ..., l_N) \in L$, and the goal is to insure ...
ShallowBlue's user avatar
3 votes
0 answers
86 views

Reference on the faces of the circulation polytope

On page 4 of Generating all vertices of a polyhedron is hard it is mentioned that the facial structure of the circulation polyhedron* is well understood. I am trying to find a reference for this. I ...
Elle Najt's user avatar
  • 1,462
2 votes
1 answer
85 views

The number of Hamiltonian circuits on a convex polytope embedded in $\mathbb{R}^N$

Recently I wondered whether there might be a natural topological complexity measure for convex polytopes embedded in $\mathbb{R}^N$. After some reflection it occurred to me that the number of distinct ...
Aidan Rocke's user avatar
  • 3,871
2 votes
1 answer
119 views

Anchor sets for lattice polygons: Part I

Suppose $V=\{(x_1,y_1), (x_2,y_2),\dots,(x_v,y_v)\}$ is a vertex set of lattice points satisfying $$0=x_1<x_2<\dots<x_v \qquad \text{and} \qquad y_1>y_2>\cdots>y_{v-1}>y_v=0.$$ ...
T. Amdeberhan's user avatar
1 vote
1 answer
101 views

Graph diameter of the omnitruncated $E_8$ polytope

What is the graph diameter of the 1-skeleton of the omnitruncate of the $E_8$ family of uniform 8-polytopes?
Daniel Sebald's user avatar
1 vote
0 answers
125 views

Growth polynomial of the Associahedron graph ? (Is it approximately Gaussian ?)

Consider Associahedron, consider graph build from its vertices and edges. Choose some vertex. Let us count the number of vertices on distances $k$ from the selected vertex. Write a generating ...
Alexander Chervov's user avatar
1 vote
1 answer
219 views

approximate diameter of polytopes in high dimensions

I just came across the following problem: Let us consider the unit corner of the n-cube $$ \Delta^n = \left\{(t_1,\cdots,t_n)\in\mathbb{R}^n\mid\sum_{i = 1}^{n}{t_i} \leq 1 \mbox{ and } t_i \ge 0 \...
rjm's user avatar
  • 75