The theta-pyramid-prism-turtle minimal separator conjecture
Statement
A graph is a finite undirected graph, and a minimal separator is a vertex set that minimally separates some pair of vertices. Theta-pyramid-prism-turtle conjecture. There is a polynomial such that every graph that contains no theta, pyramid, prism, or turtle has at most minimal separators. This conjecture asks whether forbidding these four graph configurations guarantees polynomially many minimal separators; the paper presents it as a conjecture from the cited work, and its status is not resolved here.
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.