ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph. Write Z(G)Z(G) for its zero forcing number, let dim⁡(G)\dim(G) denote its metric dimension, and let c(G)c(G) be the number of edges that must be removed from GG to obtain a forest. Cycle-rank conjecture.

dim⁡(G)≤Z(G)+c(G).\dim(G) \leq Z(G)+c(G).

This conjecture compares two graph parameters and is known for trees and graphs with one cycle. The paper proves a weaker bound, so the conjecture remains open in the stated generality.

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.