ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a triangle-free graph with minimum degree deltageq2delta geq 2.

Triangle-free zero-forcing conjecture.

2δ−2≤Z(G).2\delta -2 \leq Z(G).

This is the g=4g=4 specialization of the broader girth–minimum-degree conjecture and concerns improving the trivial minimum-degree lower bound for triangle-free graphs. The paper presents it as a conjecture analogous to its proved bounds, but does not establish it 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.