#Can a graph with 2 nodes of degree 5 have an Euler path?

16 messages · Page 1 of 1 (latest)

cobalt hill
#

ik that

For a graph to have an Euler path:
    - Every vertex must have an **even** degree
    - Have exactly **zero** or **two** vertices with an odd degree
``` and all examples I have seen use degree 3 for the odd ones, but not sure if all odd numbers (5, 7, 9...) also work
livid egretBOT
#
  1. Wait patiently for a helper to come along.
  2. Once someone helps you, say thank you and close the thread with:
+close
  1. Feel free to nominate the person for helper of the week in #helper-nominations
  2. Do not ping the mods, unless someone is breaking the rules.
  3. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
naive trout
#

Yes, for every oddnit also works:

#

This is for two vertices of degree 5

#

But you can add triangles to make 2 vertices of odd degree (can be different)

cobalt hill
zealous stormBOT
#

@cobalt hill has given 1 rep to @naive trout

astral trail
# cobalt hill ty :)

What would happen if there were 4 vertices of an odd degree? Is an Eulerian path impossible then?

cobalt hill
#

no, its only possible if and only if there are 0 or 2 odd degree vertices

viral igloo
#

Though, now that I think about it, I can't think of any graphs with just one odd-degree vertex...

naive trout
#

No 1 odd degree isn't possible because if you start on it you can't end on it and there are no other odd degree vertices

astral trail