General position sets, colinear sets, and Sierpi\'nski product graphs
Abstract
Let G f H denote the Sierpi\'nski product of graphs G and H with respect to the function f. The Sierpi\'nski general position number gp S(G,H) is introduced as the cardinality of a largest general position set in G f H over all possible functions f. Similarly, the lower Sierpi\'nski general position number gp S(G,H) is the corresponding smallest cardinality. The concept of vertex-colinear sets is introduced. Bounds for the general position number in terms of extremal vertex-colinear sets, and bounds for the (lower) Sierpi\'nski general position number are proved. The extremal graphs are investigated. Formulas for the (lower) Sierpi\'nski general position number of the s with K2 as the first factor are deduced. It is proved that if m,n≥ 2, then gp S(Km,Kn) = m(n-1) and that if n 2m-2, then gp S(Km,Kn) = m(n-m+1).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.