Erdős Problem #816 — Equal-degree endpoints of a three-edge path
Statement
Must every graph on vertices with edges contain two vertices of the same degree joined by a path of length three?
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.