For graphs H,H', if they are 2-equivalent must they be 3-equivalent, or can a pair be 100-equivalent but not 101-equivalent; and is it merely coincidental that known pairs…
Statement
For graphs H,H', if they are 2-equivalent must they be 3-equivalent, or can a pair be 100-equivalent but not 101-equivalent; and is it merely coincidental that known pairs which are 3-equivalent but not 2-equivalent include a disconnected graph?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.