Uniqueness conjecture for cograph minimal (∞,k)-polar obstructions
Statement
A cograph minimal -polar obstruction is a cograph that is not -polar but whose every proper induced subgraph is -polar; its type records its number of connected components and its number of isolated vertices. For integers satisfying
Uniqueness conjecture. There exists exactly one cograph minimal -polar obstruction of type . This extends the cases for which uniqueness is established and leaves the remaining admissible types to be characterized.
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.