The additive lower bound for m-eternal vertex cover
The additive lower bound for m-eternal vertex cover
Let be a connected graph, let be a subgraph of , and let be the subgraph induced by the vertices outside . Write for minimum degree and let denote the m-eternal vertex cover number. The additive eternal vertex cover conjecture. If
then
The source presents this as an open conjecture in the eternal vertex-cover model.
Sources & referencesView supporting material
Primary source
William F. Klostermeyer and Christina M. Mynhardt, “Protecting a Graph with Mobile Guards”, arXiv:1407.5228 (2015).
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
Sign in to submit a solution.
No solutions have been posted yet.