The DET:OLD density conjecture for -free cubic graphs
Let be a -free cubic graph, and let DET:OLD 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 DET:OLD 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.
References
- Devin Jean and Suk Seo, “On Error-detecting Open-locating-dominating sets”, arXiv:2306.12583 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.