0xDE (11011110) wrote,

Splitting the buckyball

Here's a geometric graph puzzle for you. Start with the graph of the truncated icosahedron, with 60 vertices and 90 edges. Delete a matching (a set of edges that do not touch each other) consisting only of edges that belong to pentagons in the truncated icosahedron, in order to maximize the number of connected components of the remaining graph. How many components can you make?
Tags: geometry, graph theory
  • Post a new comment


    default userpic

    Your reply will be screened

    Your IP address will be recorded