ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (n,m)(n,m) be nonnegative integers, and let P4\mathcal{P}_4 denote the family of triangle-free planar graphs. Write ωr(n,m)(P4)\omega_{r(n,m)}(\mathcal{P}_4) for the maximum (n,m)(n,m)-relative clique number in this family.

Chakraborty–Das–Nandi–Roy–Sen's triangle-free relative clique conjecture.

ωr(n,m)(P4)=2(2n+m)2+2.\omega_{r(n,m)}(\mathcal{P}_4)=2(2n+m)^2+2.

The conjecture extends the open (1,0)(1,0)-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 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.