On general position sets in Cartesian products
Combinatorics
2021-05-11 v4
Abstract
The general position number of a connected graph is the cardinality of a largest set of vertices such that no three distinct vertices from lie on a common geodesic; such sets are refereed to as gp-sets of . The general position number of cylinders is deduced. It is proved that whenever , , and . A probabilistic lower bound on the general position number of Cartesian graph powers is achieved. Along the way a formula for the number of gp-sets in , where , is also determined.
Keywords
Cite
@article{arxiv.1907.04535,
title = {On general position sets in Cartesian products},
author = {Sandi Klavžar and Balázs Patkós and Gregor Rus and Ismael G. Yero},
journal= {arXiv preprint arXiv:1907.04535},
year = {2021}
}