ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be graphs, let G□HG\mathbin{\square}H denote their Cartesian product, and let gp⁡−(G)\operatorname{gp}^-(G) denote the lower general position number of GG. Kruft's conjecture. For any graphs GG and HH,

gp⁡−(G□H)≥min⁡{gp⁡−(G),gp⁡−(H)}.\operatorname{gp}^-(G\mathbin{\square}H)\geq\min\{\operatorname{gp}^-(G),\operatorname{gp}^-(H)\}.

The inequality has been verified for all pairs of graphs of order at most six, but remains open in general.

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.