Positive fading number conjecture for odd non-cycle graphs
Statement
Let be a graph distinct from , where is odd, and suppose that its clique number satisfies
Here denotes the positive fading number of .
Positive fading number conjecture. For every such graph,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.