The three-sevenths upper-bound conjecture for the isolation game
Statement
Let be a graph, let denote its order, and let and denote the game isolation numbers when Dominator and Staller, respectively, start. A graph has no -components if none of its connected components is isomorphic to . Three-sevenths upper-bound conjecture. For any graph with no -components,
The conjecture would improve the proved upper bound for the isolation game. The bound is supported by examples attaining the three-sevenths value, but no proof is given and the conjecture remains open.
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.