ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. A set S⊆V(G)S\subseteq V(G) is a terminal set if SS is a general position set of GG and adding any vertex u∈V(G)−Su\in V(G)-S to SS creates three-in-a-line with uu 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 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.