The 4-connected 2-cyclic graph edge conjecture
Statement
Let be a graph on vertices. It is 4-connected if its vertex connectivity is at least , and it is 2-cyclic if every vertex set of size at most is dominating or has a cycle in its neighborhood.
4-connected 2-cyclic edge conjecture. If is 4-connected and 2-cyclic, then
The conjecture is proposed because it would improve the paper's bound for connected graphs with no forest cut and thereby give progress toward the Chernyshev–Rauch–Rautenbach forest-cut conjecture. It is not resolved in the paper.
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.