The linear-forest conjecture for intersectionwise self-χ-guarding graph classes
Statement
A linear forest is a forest in which every component is a path. For a graph , an -free graph is a graph with no induced subgraph isomorphic to ; a class is intersectionwise self--guarding when it has the property defined in the paper.
Linear-forest conjecture. If is a linear forest, then the class of -free graphs is intersectionwise self--guarding.
The preceding results establish this property for stars and for -free graphs, while the paper's corollary shows that any graph whose -free class is intersectionwise self--guarding must be a linear forest or a star. The conjecture addresses the remaining linear-forest cases.
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.