ProbXiv
Explorersign in
Problem archiveProblem record

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 GG contains an induced rainbow path on χ(G)\chi(G) vertices. This is a rainbow strengthening of the known theorem that every triangle-free graph contains an induced path on χ(G)\chi(G) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.