Forest-cut conjecture for sparse graphs
Statement
Let be a finite, simple, undirected graph of order , and call a vertex set a forest cut if it is a vertex cut whose induced subgraph is a forest. Forest-cut conjecture. If has less than edges, then 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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.