Improved upper bounds for Staller–Maker–Breaker domination numbers
Improved upper bounds for Staller–Maker–Breaker domination numbers
Let be a graph on vertices, with minimum degree . The S-game and D-game parameters are denoted by and , respectively.
Improved SMBD-number bounds.
These bounds would improve the known sharp general upper bounds when the minimum degree is at least two; the authors note that sharp examples under this degree condition are not known.
Sources & referencesView supporting material
Primary source
Csilla Bujtás and Pakanun Dokyeesun, “Fast winning strategies for Staller in the Maker-Breaker domination game”, arXiv:2206.12812 (2022).
Additional references
6 papers in this index state this conjecture (2009–2022). The statement above is taken from the most recent of them; the others are arXiv:2107.10805, arXiv:2106.01166, arXiv:1606.01317, arXiv:1503.07891, arXiv:0906.4142.
Progress summary
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.