ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on n≥9n\geq 9 vertices. It is 4-connected if its vertex connectivity is at least 44, and it is 2-cyclic if every vertex set of size at most 22 is dominating or has a cycle in its neighborhood.

4-connected 2-cyclic edge conjecture. If GG is 4-connected and 2-cyclic, then

e(G)≥73n.e(G)\geq \frac73n.

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 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.