The γ–θ conjecture in eternal domination
Statement
The – conjecture asserts that for every finite graph ,
where is the domination number, is the eternal domination number in the one-guard-moves model, and is the vertex clique-cover number.
The conjecture is false. The complement of the 243-vertex ternary Golay graph satisfies
Record
- Source
- Added
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.