ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order nn, and let a forest cut mean a vertex cut MM such that the subgraph G∣MG|_M induced by the cut vertices is a forest.

Chernyshev–Rauch–Rautenbach conjecture. If GG has fewer than 3n−63n-6 edges, then GG has a forest cut.

The conjecture is known for planar graphs, while the paper improves previously proved linear edge bounds to fewer than (19n−28)/8(19n-28)/8 edges; the sharp threshold 3n−63n-6 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 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.