Kruft's lower general position number conjecture for Cartesian products
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.
References
Primary source
Ullas Chandran S. V., Sandi Klavžar and James Tuite, “The General Position Problem: A Survey”, arXiv:2501.19385 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.