| dc.contributor.author | Klavžar, Sandi | |
| dc.contributor.author | Patkós, Balázs | |
| dc.contributor.author | Rus, Gregor | |
| dc.contributor.author | González Yero, Ismael | |
| dc.contributor.other | Matemáticas | es_ES |
| dc.date.accessioned | 2022-03-25T07:33:27Z | |
| dc.date.available | 2022-03-25T07:33:27Z | |
| dc.date.issued | 2021-08 | |
| dc.identifier.issn | 1422-6383 | |
| dc.identifier.issn | 1420-9012 | |
| dc.identifier.uri | http://hdl.handle.net/10498/26516 | |
| dc.description.abstract | The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three distinct vertices from S lie on a common geodesic; such sets are refereed to as gpsets of G. The general position number of cylinders Pr square Cs is deduced. It is proved that gp(Cr square C-s). {6, 7} whenever r >= s = 3, s >=not equal 4, and r >= 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 Pr square Ps, where r, s >= 2, is also determined. | es_ES |
| dc.format | application/pdf | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | SPRINGER BASEL AG | es_ES |
| dc.rights | Atribución 4.0 Internacional | * |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | * |
| dc.source | Results Math 76, 123 (2021) | es_ES |
| dc.subject | General position problem | es_ES |
| dc.subject | Cartesian product of graphs | es_ES |
| dc.subject | paths and cycles | es_ES |
| dc.subject | probabilistic constructions | es_ES |
| dc.subject | exact enumeration | es_ES |
| dc.title | On General Position Sets in Cartesian Products | es_ES |
| dc.type | journal article | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.identifier.doi | 10.1007/s00025-021-01438-x | |