ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite, simple, undirected graph of order nn, and call a vertex set a forest cut if it is a vertex cut whose induced subgraph is a forest. Forest-cut conjecture. If GG has less than 3n−63n-6 edges, then GG has a forest cut. Maximal planar graphs do not have such vertex cuts, so the density condition would be best possible; the conjecture is verified for planar graphs, and the paper proves the weaker bound that less than 115n−185\frac{11}{5}n-\frac{18}{5} edges suffice 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.