ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A linear forest is a forest in which every component is a path. For a graph HH, an HH-free graph is a graph with no induced subgraph isomorphic to HH; a class is intersectionwise self-χ\chi-guarding when it has the property defined in the paper.

Linear-forest conjecture. If HH is a linear forest, then the class of HH-free graphs is intersectionwise self-χ\chi-guarding.

The preceding results establish this property for stars and for P4P_{4}-free graphs, while the paper's corollary shows that any graph HH whose HH-free class is intersectionwise self-χ\chi-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 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.