Kruft's lower general position number conjecture for Cartesian products

From papers

Let GG and HH be graphs, let GHG\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(GH)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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Ullas Chandran S. V., Sandi Klavžar and James Tuite, “The General Position Problem: A Survey”, arXiv:2501.19385 (2026).

Solutions 0

No solutions have been posted yet.