Garijo–González–Márquez conjecture on location-domination in twin-free connected graphs
Statement
Let denote the maximum location-domination number of a twin-free, connected graph on vertices. Garijo–González–Márquez conjecture. There exists a positive integer such that, for every ,
Garijo, González, and Márquez proved the matching lower bound for every ; the conjecture asserts that this lower bound is eventually exact.
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.