Chernyshev–Rauch–Rautenbach conjecture on sparse graphs and forest cuts
Statement
Let be a graph of order , and let a forest cut mean a vertex cut such that the subgraph induced by the cut vertices is a forest.
Chernyshev–Rauch–Rautenbach conjecture. If has fewer than edges, then has a forest cut.
The conjecture is known for planar graphs, while the paper improves previously proved linear edge bounds to fewer than edges; the sharp threshold remains unresolved in general.
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.