Chakraborty–Das–Nandi–Roy–Sen's relative clique conjecture for triangle-free planar graphs
Statement
Let be nonnegative integers, and let denote the family of triangle-free planar graphs. Write for the maximum -relative clique number in this family.
Chakraborty–Das–Nandi–Roy–Sen's triangle-free relative clique conjecture.
The conjecture extends the open -graph problem about relative clique numbers. Its status is not resolved in the supplied material.
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.