Davila–Kenter forcing-number conjecture for graphs with given girth
Let be a graph with girth and minimum degree . Its forcing number is the cardinality of a smallest forcing set, where a forcing set is an initial set of colored vertices from which the iterative forcing process colors every vertex of .
Davila–Kenter conjecture.
The conjecture gives a lower bound for the forcing number in terms of minimum degree and girth. The supplied material does not state whether it has been resolved.
References
- Randy Davila and Michael Henning, “The forcing number of graphs with a given girth”, arXiv:1610.08435 (2016).
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.