Mutual-visibility number conjecture for Cartesian products of paths and cycles
Let be the path on vertices and the cycle on vertices, and let denote the mutual-visibility number of a graph . Mutual-visibility number conjecture. If , then
The equality is known in the range from the constructions and computational results discussed in the paper, while the assertion for all remains open.
References
- 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.