The DET:OLD density conjecture for C_4-free cubic graphs
Statement
Let be a -free cubic graph, and let denote the minimum density of an error-detecting open-locating-dominating set in . DET:OLD density conjecture.
The bound would improve the general upper bound for cubic graphs that permit DET:OLD, and is motivated by the extremal cubic graphs found on through vertices. Whether 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.