Akbari et al.'s Caro–Wei bound for induced linear forests
Statement
All graphs are finite, simple, and undirected; for a graph , let be its vertex set and let denote the degree of . A linear forest is a forest in which every component is a path. If has minimum degree at least , then Akbari et al.'s conjecture. has an induced linear forest with at least
vertices. This conjecture strengthens the case of the Alon–Kahn–Seymour bound, which guarantees an induced forest of this order but does not require its components to be paths. The conjecture is the motivating statement of the paper; the supplied text gives no evidence that it has been resolved.
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.