Kruft's lower general position number conjecture for Cartesian products
Statement
Let and be graphs, let denote their Cartesian product, and let denote the lower general position number of . Kruft's conjecture. For any graphs and ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.