ProbXiv
Explorersign in
Problem archiveProblem record

Statement

All graphs are finite, simple, and undirected; for a graph GG, let V(G)V(G) be its vertex set and let d(v)d(v) denote the degree of vv. A linear forest is a forest in which every component is a path. If GG has minimum degree at least 22, then Akbari et al.'s conjecture. GG has an induced linear forest with at least

∑v∈V(G)2d(v)+1\sum_{v\in V(G)} \frac{2}{d(v)+1}

vertices. This conjecture strengthens the k=1k=1 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 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.