Kruft's terminal-set conjecture
Statement
Let be a graph. A set is a terminal set if is a general position set of and adding any vertex to creates three-in-a-line with as an endpoint. Kruft's conjecture. Every graph has a terminal set.
Terminal sets correspond to maximal general position sets contained in a layer of a Cartesian product. The conjecture is known for graphs of diameter at most three, cographs, and chordal graphs, 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.