An exactly one-intersecting family satisfies for every two distinct members. It is nontrivial when the intersection of all its members is empty.
A finite linear space consists of a finite set of points and a set family of subsets called lines, each containing at least two points, such that each pair of distinct points lies on exactly one line. Here the nontrivial convention also excludes a line equal to all of . Two distinct lines therefore meet in at most one point, and counting pairs gives
Near-pencils and finite projective planes, including the Fano plane, are examples. The De Bruijn--Erdos pair-covering inequality concerns the corresponding point degrees. The original line-count theorem proves , with equality only for a near-pencil or a finite projective plane.[ref]
An exactly one-intersecting family with empty total intersection gives such a structure by using its members as points. Each original ground element supplies the set of members containing it. Discard the resulting sets of size zero or one; the others are lines, and every pair of member-points belongs to its unique shared-element line. Empty total intersection excludes an all-point line.
If denotes the number of lines through in a nontrivial finite linear space on points, then
To prove it, let be the line sizes. The inequalities whenever , counted at each integer threshold, give
for every . Summing in and using gives
where the last identity counts pairs of points by their unique line.
A near-pencil on points has one line containing points and two-point lines joining the remaining point to each point of the large line.
This is a particular finite linear space configuration, rather than a synonym for every pencil of lines.
A finite projective plane of order has points and the same number of lines. Every line contains points, every point lies on lines, and every two points or two lines determine a unique line or intersection point respectively.

Articles by others on the same topic (0)

There are currently no matching articles.