ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n and PmP_m be paths, and let Pn×PmP_n\times P_m denote their Cartesian product. Write b( ⋅ )b(\,\cdot\,) for the bondage number. Path-product bondage conjecture. For m⩾5m\geqslant5,

b(Pn×Pm)⩽2.b(P_n\times P_m)\leqslant2.

The source motivates this by the behavior of vertex removal in path products but gives no resolution.

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.