ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order nn with no isolated vertices. A graph is twin-free if no two distinct vertices have the same open or closed neighborhood, and let γL(G)\gamma_L(G) be its location-domination number. Foucaud–Henning conjecture. Every twin-free graph GG of order nn without isolated vertices satisfies

γL(G)≤n2.\gamma_L(G)\le\frac{n}{2}.

This is proposed as a strengthening of the Garijo–González–Márquez conjecture and as an analogue of Ore’s one-half bound for the domination number; its status is 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.