ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with maximum degree Δ(G)≥2\Delta(G)\geq 2. For positive integers m,nm,n, GmnG^{\frac{m}{n}} denotes the mm-power of the nn-subdivision of GG; in particular, G22G^{\frac{2}{2}} and G33G^{\frac{3}{3}} are the corresponding fractional powers, and χ\chi denotes chromatic number. Fractional-power comparison conjecture.

χ(G22)≤χ(G33).\chi(G^{\frac{2}{2}})\leq\chi(G^{\frac{3}{3}}).

The source presents this as a consequence that would follow if the total coloring conjecture were correct, and attributes it to the cited work of Mahsa. Its general status is not resolved in the supplied text.

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.