Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Menger's theorem question
Replies: 5   Last Post: Jan 20, 2011 11:58 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Henry

Posts: 1,089
Registered: 12/6/04
Re: Menger's theorem question
Posted: Jan 20, 2011 11:58 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Jan 17, 6:28 pm, Robert Israel
<isr...@math.MyUniversitysInitials.ca> wrote:

> Surely it depends on the polyhedron?  E.g. for an octahedron there
> are 4 pairwise vertex-independent paths between non-adjacent
> vertices.


4 paths for adjacent vertices too.

Indeed the number of pairwise vertex-independent paths for any pair of
non-identical vertices from any Platonic polyhedron is equal to the
number of edges meeting at each vertex (so 3 for a tetrahedron, cube
or dodecahedron, 4 for an octahedron and 5 for an icosahedron).



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.