← All problems

Mutual-visibility number conjecture for Cartesian products of paths and cycles

3 years old · traced to

Let PsP_s be the path on ss vertices and CtC_t the cycle on tt vertices, and let cmu(G)cmu(G) denote the mutual-visibility number of a graph GG. Mutual-visibility number conjecture. If tcge12t cge 12, then

cmu(PscBoxCt)=cmin{3s,2t}.cmu(P_s cBox C_t) = cmin\{3s, 2t\}.

The equality is known in the range 12cletcle1712 cle t cle 17 from the constructions and computational results discussed in the paper, while the assertion for all tcge12t cge 12 remains open.

References
  1. Danilo Korže and Aleksander Vesel, “Mutual-visibility sets in Cartesian products of paths and cycles”, arXiv:2309.15201 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.