The first- and second-degree bound for Snort temperature
Statement
Let be a graph. In the impartial graph game Snort, let denote the temperature of the position on , let be the maximum degree of , and let be the maximum number of vertices at distance from any vertex of . The first- and second-degree bound. When playing Snort on , one has
The paper has shown that Snort temperature cannot be bounded by a multiple of the degree, while this conjecture proposes that the first and second degrees suffice for a bound. Its resolution is not given in the supplied text.
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.