English

On general position sets in Cartesian products

Combinatorics 2021-05-11 v4

Abstract

The general position number gp(G){\rm gp}(G) of a connected graph GG is the cardinality of a largest set SS of vertices such that no three distinct vertices from SS lie on a common geodesic; such sets are refereed to as gp-sets of GG. The general position number of cylinders PrCsP_r\,\square\, C_s is deduced. It is proved that gp(CrCs){6,7}{\rm gp}(C_r\,\square\, C_s)\in \{6,7\} whenever rs3r\ge s \ge 3, s4s\ne 4, and r6r\ge 6. 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 PrPsP_r\,\square\, P_s, where r,s2r,s\ge 2, 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}
}
R2 v1 2026-06-23T10:17:06.157Z