On general position sets in Cartesian products

DOI10.1007/s00025-021-01438-xzbMath1468.05249arXiv1907.04535OpenAlexW3165208018MaRDI QIDQ2041227

Balázs Patkós, Gregor Rus, Sandi Klavžar, Ismael González Yero

Publication date: 16 July 2021

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.04535

zbMATH Keywords

exact enumerationCartesian product of graphspaths and cyclesprobabilistic constructionsgeneral position problem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Distance in graphs (05C12) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (20)

The general position achievement game played on graphs ⋮ Mutual visibility in graphs ⋮ General position sets in two families of Cartesian product graphs ⋮ Variety of mutual-visibility problems in graphs ⋮ TRAVERSING A GRAPH IN GENERAL POSITION ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ On the general position numbers of maximal outerplane graphs ⋮ Some position problems for graphs ⋮ Edge general position sets in Fibonacci and Lucas cubes ⋮ Extremal edge general position sets in some graphs ⋮ The general position avoidance game and hardness of general position games ⋮ General position polynomials ⋮ Mutual-visibility sets in Cartesian products of paths and cycles ⋮ A Steiner general position problem in graph theory ⋮ The general position problem on Kneser graphs and on some graph operations ⋮ On the general position number of two classes of graphs ⋮ The edge general position problem ⋮ On the mutual visibility in Cartesian products and triangle-free graphs ⋮ General d-position sets ⋮ The doubly metric dimension of cylinder graphs and torus graphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• \((2,1)\)-separating systems beyond the probabilistic bound
• Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
• A note on the no-three-in-line problem on a torus
• No-three-in-line-in-3D
• On no-three-in-line problem on \(m\)-dimensional torus
• On the extremal combinatorics of the Hamming space
• The general position problem on Kneser graphs and on some graph operations
• The general position number of Cartesian products involving a factor with small diameter
• The general position problem and strong resolving graphs
• Characterization of general position sets and its applications to cographs and bipartite graphs
• On the geodetic rank of a graph
• General position subsets and independent hyperplanes in \(d\)-space
• The general position number of integer lattices
• The Graph Theory General Position Problem on Some Interconnection Networks
• A GENERAL POSITION PROBLEM IN GRAPH THEORY
• Characterization of classes of graphs with large general position number
• On the general position problem on Kneser graphs
• On the General Position Number of Complementary Prisms
• THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES
• On the General Position Subset Selection Problem

This page was built for publication: On general position sets in Cartesian products