Problem 781

A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.

This forum is NOT meant to discuss solution methods for a problem.

In particular don't post any code fragments or results.

Don't start begging others to give partial answers to problems

Don't ask for hints how to solve a problem

Don't start a new topic for a problem if there already exists one


See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
Post Reply
jconsidi
Posts: 1
Joined: Wed Aug 03, 2022 3:18 am

Problem 781

Post by jconsidi »

I think there is an ambiguity or missing constraint in the graph definition for Problem 781. Five example graphs are given to support F(4)=5, but the last example (below) could have the direction of the top blue loop reversed to get another graph. The resulting graph would not be isomorphic to the given examples since the left and right red edges are distinguishable due to sharing vertices with the incoming and outgoing blue edges respectively.
p781-ambiguous.png
Is isomorphism not the way to consider distinct graphs for this problem? Or are the directions of the blue edges not taken into account?
You do not have the required permissions to view the files attached to this post.
User avatar
jaap
Posts: 588
Joined: Tue Mar 25, 2008 3:57 pm
Contact:

Re: Problem 781

Post by jaap »

If you reverse the direction of those two blue edges, the graph is the same, cause you are just swapping the location of the two blue edges without changing which nodes they connect. It would be more obvious if the two blue edges were drawn parallel rather than one straight and one curved.
Post Reply