ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph distinct from CnC_n, where nn is odd, and suppose that its clique number satisfies

ω(G)<χ(G).\omega(G)<\chi(G).

Here f+(G)f^+(G) denotes the positive fading number of GG.

Positive fading number conjecture. For every such graph,

f+(G)>0.f^+(G)>0.

The claim proposes a sufficient condition for a graph to have positive fading number. It appears in the paper's conclusion as an important open problem; no resolution is supplied in the given source.

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.