ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a C4C_4-free cubic graph, and let DET:OLD%(G)\textrm{DET:OLD}\%(G) denote the minimum density of an error-detecting open-locating-dominating set in GG. DET:OLD density conjecture.

DET:OLD%(G)≤2122.\textrm{DET:OLD}\%(G) \leq \frac{21}{22}.

The bound would improve the general upper bound DET:OLD%(G)≤3031\textrm{DET:OLD}\%(G) \leq \frac{30}{31} for cubic graphs that permit DET:OLD, and is motivated by the extremal cubic graphs found on 1616 through 2424 vertices. Whether 2122\frac{21}{22} is the tight upper bound for all relevant cubic graphs remains open.

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.