Aravind's induced rainbow path conjecture
Statement
A graph is properly colored if adjacent vertices receive distinct colors, and a vertex-colored graph is rainbow if no two vertices have the same color. A graph is triangle-free if it contains no triangle. Aravind's conjecture. Every properly colored triangle-free graph contains an induced rainbow path on vertices. This is a rainbow strengthening of the known theorem that every triangle-free graph contains an induced path on vertices; the supplied text does not state whether the conjecture has been resolved.
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.