OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Barnette's conjecture

 Home Mathematics Fields of mathematics Graph theory Graph theory objects Hamiltonian paths and cycles
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Barnette's conjecture is a proposition in the field of combinatorial geometry, specifically concerning polyhedra. It states that for a polyhedron with \( n \) vertices, the number of faces \( f \) must satisfy the inequality: \[ f \leq 2n - 4 \] This conjecture essentially posits an upper bound on the number of faces in a convex polyhedron based on its number of vertices.

 Ancestors (6)

  1. Hamiltonian paths and cycles
  2. Graph theory objects
  3. Graph theory
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook