Hirsch Conjecture ★★★

Author(s): Hirsch

Conjecture   Let $ P $ be a convex $ d $-polytope with $ n $ facets. Then the diameter of the graph of the polytope $ P $ is at most $ n-d $.

Keywords: diameter; polytope

Fowler's Conjecture on eigenvalues of (3,6)-polyhedra ★★

Author(s): Fowler

Conjecture   Let $ G $ be the graph of a $ (3,6) $-polyhedron with $ 2k + 4 $ vertices. Then the eigenvalues of $ G $ can be partitioned into three classes: $ K = \{3, -1, -1, -1\} $, $ P = {x_1, ..., x_k\} $ (where $ x_i $ is nonnegative for $ i = 1, \dots , k $), and $ N = - P $.

Keywords: (3,6)-polyhedron; eigenvalues

Greenthumb guide

Use the Comments link in the Greenthumb menu to delete any unwanted comments. For an open problem submission which is not up to par, go to the comments section and then either demote it to the second tier by "unpublishing", or if it is truly worthless, delete. Please be very careful when doing so!

    Adding a category
  • Keep the Title short
  • The Body should generally be left empty
  • no need to touch Input format
  • for Category information, the only fields which need be touched are Container and Parent.
  • set Comment settings to "disabled".
  • Menu settings