1 problem

0 votes0 replies0 views
A join upper-bound conjecture for the hyperopic cop number
Let $G$ and $J$ be connected graphs. Write $G\vee J$ for their graph join, $c_H(X)$ for the hyperopic cop number of a graph $X$ , and let $\Upsilon(X)$ denote the maximum size of a…
Conjectureopencops-and-robber graph-theory hyperopic-copsarXiv posted 2 days ago

A join upper-bound conjecture for the hyperopic cop number