Improved upper bounds for Staller–Maker–Breaker domination numbers
Statement
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.
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.