1 problem

Neighborhood domination conjecture. If $H$ is a vertex-transitive reflection graph with diameter $d$, then $H(\ell)$ dominates $H(k)$ for all $1\leq k\leq \ell\leq d$.