ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Kn1,n2,…,ntK_{n_1,n_2,\dots, n_t} be the complete tt-partite graph with part sizes n1,n2,…,ntn_1,n_2,\dots,n_t. If this graph is the graph of a polytope, then the set of its part sizes satisfies

n1,n2,…,nt⊂1,2.\\{n_1, n_2, \dots, n_t\\} \subset \\{1, 2\\}.

Espenschied's conjecture. If Kn1,n2,…,ntK_{n_1,n_2,\dots, n_t} is the graph of a polytope, then n1,n2,…nt⊂1,2\\{n_1, n_2, \dots n_t\\} \subset \\{1, 2\\} as sets. The classification of polytopes and combinatorial 33-spheres with at most nine vertices provides applications to questions about which graphs can occur as the graphs of polytopes. The conjecture is attributed to Espenschied's work, but its resolution is not specified here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.