A note on domination in intersecting linear systems
Abstract
A linear system is a pair (P,L) where L is a family of subsets on a ground finite set P such that |l l|≤ 1, for every l,l ∈ L. The elements of P and L are called points and lines, respectively, and the linear system is called intersecting if any pair of lines intersect in exactly one point. A subset D of points of a linear system (P,L) is a dominating set of (P,L) if for every u∈ P D there exists v∈ D such that u,v∈ l, for some l∈L. The cardinality of a minimum dominating set of a linear system (P,L) is called domination number of (P,L), denoted by γ(P,L). On the other hand, a subset R of lines of a linear system (P,L) is a 2-packing if any three elements of R have not a common point (are triplewise disjoint). The cardinality of a maximum 2-packing of a linear system (P,L) is called 2-packing number of (P,L), denoted by 2(P,L). It is know for intersecting linear systems (P,L) of rank r it satisfies γ(P,L)≤ r-1. In this note we prove, if q is an even prime power and (P,L) is an intersecting linear system of rank q+2 satisfying γ(P,L)=q+1, then this linear system can be constructed from a spanning (q+1)-uniform intersecting linear subsystem (P,L) of the projective plane of order q satisfying τ(P,L)=2(P,L)-1=q+1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.