Espenschied's conjecture on complete multipartite graphs of polytopes
Statement
Let be the complete -partite graph with part sizes . If this graph is the graph of a polytope, then the set of its part sizes satisfies
Espenschied's conjecture. If is the graph of a polytope, then as sets. The classification of polytopes and combinatorial -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.