591
Views
3
CrossRef citations to date
0
Altmetric
Articles

On transversal and 2-packing numbers in uniform 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 |ll|1, for every l,lL. 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 T of points of P is a transversal of (P,L) if T intersects any line, and the transversal number, τ(P,L), is the minimum order of a transversal. On the other hand, a 2-packing set of a linear system (P,L) is a set R of lines, such that any three of them have a common point, then the 2-packing number of (P,L), ν2(P,L), is the size of a maximum 2-packing set. It is known that the transversal number τ(P,L) is bounded above by a quadratic function of ν2(P,L). An open problem is to characterize the families of linear systems which satisfies τ(P,L)λν2(P,L), for some λ1. In this paper, we give an infinite family of linear systems (P,L) which satisfies τ(P,L)=ν2(P,L) with smallest possible cardinality of L, as well as some properties of r-uniform intersecting linear systems (P,L), such that τ(P,L)=ν2(P,L)=r. Moreover, we state a characterization of 4-uniform intersecting linear systems (P,L) with τ(P,L)=ν2(P,L)=4.

1 Introduction

A linear system is a pair (P,L) where L is a family of subsets on a ground finite set P, such that |ll|1, for every pair of distinct subsets l,lL. The linear system (P,L) is intersecting if |ll|=1, for every pair of distinct subsets l,lL. The elements of P and L are called points and lines, respectively; a line with exactly r points is called a r-line, and the rank of (P,L) is the maximum cardinality of a line in (P,L), when all the lines of (P,L) are r lines we have a r-uniform linear system. In this context, a simple graph is a 2-uniform linear system.

A subset TP is a transversal (also called vertex cover or hitting set in many papers, as example Citation[1–11]) of (P,L) if for any line lL satisfies Tl. The transversal number of (P,L), denoted by τ(P,L), is the smallest possible cardinality of a transversal of (P,L).

A subset RL is called 2-packing of (P,L) if three elements are chosen in R then they are not incident in a common point. The 2-packing number of (P,L), denoted by ν2(P,L), is the maximum number of a 2-packing of (P,L).

There are many interesting works studying the relationship between these two parameters, for instance, in [Citation10], the authors propose the problem of bounding τ(P,L) in terms of a function of ν2(P,L) for any linear system. In [Citation12], some authors of this paper and others proved that any linear system satisfies: (1) ν22τν2(ν21)2.(1) That is, the transversal number, τ, of any linear system is upper bounded by a quadratic function of their 2-packing number, ν2.

In order to find how a function of ν2(P,L) can bound τ(P,L), the authors of [Citation13] using probabilistic methods to prove that τλν2 does not hold for any positive λ. In particular, they exhibit the existence of k-uniform linear systems (P,L) for which their transversal number is τ(P,L)=no(n) and their 2-packing number is upper bounded by 2nk.

Nevertheless, there are some relevant works about families of linear systems in which their transversal numbers are upper bounded by a linear function of their 2-packing numbers. In [Citation14] the authors proved that if (P,L) is a 2-uniform linear system, a simple graph, with |L|>ν2(P,L) then τ(P,L)ν2(P,L)1; moreover, they characterize the simple connected graphs that attain this upper bound and the lower bound given in Eq. (1). In [Citation12] was proved that the linear systems (P,L) with |L|>ν2(P,L) and ν2(P,L){2,3,4} satisfy τ(P,L)ν2(P,L); and when they attain the equality, they are a special family of linear subsystems of the projective plane of order 3, Π3, with transversal and 2-packing numbers equal to 4. Moreover, they proved that τ(Πq)ν2(Πq) when Πq=(Pq,Lq) is a projective plane of order q, consequently the equality holds when q is odd.

The rest of this paper is structured as follows: In Section 2, we present a result about linear systems satisfying τν21. In Section 3, we give an infinite family of linear systems such that τ=ν2 with smallest possible cardinality of lines. And, finally, in Section 4, we presented some properties of the r-uniform linear systems, such that τ=ν2=r, and we characterize the 4-uniform linear systems with τ=ν2=4.

2 On linear systems with τν21

Let (P,L) be a linear system and pP be a point. It is denoted by Lp to the set of lines incident to p. The degree of p is defined as deg(p)=|Lp| and the maximum degree overall points of the linear systems is denoted by Δ(P,L). A point of degrees 2 and 3 is called double and triple point, respectively, and two points p and q in (P,L) are adjacent if there is a line lL with {p,q}l.

In this section, we generalize Proposition 2.1, Proposition 2.2, Lemma 2.1, Lemma 3.1 and Lemma 4.1 of [Citation12] proving that a linear system (P,L) with |L|>ν2(P,L) and “few” lines satisfies τ(P,L)ν2(P,L)1. Notice that, through this paper, all linear systems (P,L) are considered with |L|>ν2(P,L) due to the fact |L|=ν2(P,L) if and only if Δ(P,L)2.

Theorem 2.1

Let (P,L) be a linear system with p,qP being two points such that deg(p)=Δ(P,L) and deg(q)=max{deg(x):xP{p}}. If|L|deg(p)+deg(q)+ν2(P,L)3, thenτ(P,L)ν2(P,L)1.

Proof

Let p,qP be two points as in the theorem, and let L=L{LpLq}, which implies that |L|ν2(P,L)2. Assume that |L|=ν2(P,L)2 (LpLq), otherwise, the following set {p,q}{al:al is any point of lL} is a transversal of (P,L) of cardinality at most ν2(P,L)1, and the statement holds. Suppose that L={L1,,Lν22} is a set of pairwise disjoint lines because, in otherwise, they induce at least a double point, xP, hence the following set of points {p,q,x}{al:lLLx}, where al is any point of l, is a transversal of (P,L) of cardinality at most ν2(P,L)1, and the statement holds. Let lqLq{lp,q} be a fixed line and let lp be any line of Lp{lp,q}, where lp,q is the line containing to p and q (since LpLq). Then lplq, since the lq induce a triple point on the following 2-packing L{lp,lp,q}, which implies that there exists a line Lp,qL with lqlpLp,q, and hence lplq. Consequently, deg(q)=Δ(P,L) and Δ(P,L)ν2(P,L)1 (since deg(p)1ν2(P,L)2). Therefore, the following set: {lpLi:i=1,,Δ1}{aΔ,,aν22}{p},where ai is any point of Li, for i=Δ,,ν22, is a transversal of (P,L) of the cardinality at most ν2(P,L)1, and the statement holds.□

3 A family of uniform linear systems with τ=ν2

In this section, we exhibit an infinite family of linear systems (P,L) with two points of maximum degree and |L|=2Δ(P,L)+ν2(P,L)2 with τ(P,L)=ν2(P,L). It is immediately, by Theorem 2.1, that τ(P,L)ν2(P,L)1 for linear systems with less lines.

In the remainder of this paper, (Γ,+) is an additive Abelian group with neutral element e. Moreover, if gΓg=e, then the group is called neutral sum group. In the following, every group (Γ,+) is a neutral sum group, such that 2ge, for all gΓ{e}. As an example of this type of groups we have (Zn,+), for n3 odd.

Let n=2k+1, with k a positive integer, and (Γ,+) be a neutral sum group of order n. Let: L={Lg:gΓ{e}}, where Lg={(h,g):hΓ},for gΓ{e}, and: Lp={lpg:gΓ}, where lpg={(g,h):hΓ{e}}{p},for gΓ, and Lq={lqg:gΓ}, where: lqg={(h,fg(h)):hΓ,fg(h)=h+g with fg(h)e}{q},for gΓ.

Hence, the set of lines L is a set of pairwise disjoint lines with |L|=n1 and each line of L has n points. On the other hand, Lp and Lq are set of lines incidents to p and q, respectively, with |Lp|=|Lp|=n, and each line of LpLq has n points. Moreover, this set of lines satisfies that, giving lpaLp there exists a unique lqbLq with lpalqb=, otherwise, there exists lpaLp such that lpalqb, for all lqbLq, which implies that a+bΓ{e}, for all bΓ, which is a contradiction.

The linear system (Pn,Ln) with Pn=(Γ×Γ{e}){p,q}andLn=LLpLq, denoted by Cn,n+1, is an n-uniform linear system with n(n1)+2 points and 3n1 lines. Notice that, this linear system has 2 points of degree n (points p and q) and n(n1) points of degree 3.

A linear subsystem (P,L) of a linear system (P,L) satisfies that for any line lL there exists a line lL such that l=lP, where PP. Given a linear system (P,L) and a point pP, the linear system obtained from (P,L) by deleting the point p is the linear system (P,L) induced by L={l{p}:lL}. On the other hand, given a linear system (P,L) and a line lL, the linear system obtained from (P,L) by deleting the line l is the linear system (P,L) induced by L=L{l}. The linear systems (P,L) and (Q,M) are isomorphic, denoted by (P,L)(Q,M), if after deleting the points of degree 1 or 0 from both, the systems (P,L) and (Q,M) are isomorphic as hypergraphs (see [Citation15]).

It is important to state that in the rest of this paper is considered linear system (P,L) without points of degree one because, if (P,L) is a linear system which has all lines with at least two points of degree 2 or more, and (P,L) is the linear system obtained from (P,L) by deleting all points of degree one, then they are essentially the same linear system because it is not difficult to prove that transversal and 2-packing numbers of both coincide (see [Citation12]).

Example 3.1

Let Γ=Z3. The linear system C3,4=(P3,L3) has as set of points to P3={(0,1),(1,1),(2,1),(0,2),(1,2),(2,2)}{p}{q} and as set of lines to L3=LLpLq, where L={{(0,1),(1,1),(2,1)},{(0,2),(1,2),(2,2)}},Lp={{(0,1),(0,2),p},{(1,1),(1,2),p},{(2,1),(2,2),p}},Lq={{(1,1),(2,2),q},{(0,1),(1,2),q},{(0,2),(2,1),q}} and depicted in . This linear system is isomorphic to the linear system giving in [Citation12] Figure 3, which is the linear system with the less number of lines and maximum degree 3 such that τ=ν2=4.

Fig. 1 Linear system C3,4=(P3,L3).

Fig. 1 Linear system C3,4=(P3,L3).

Proposition 3.1

The linear system Cn,n+1 satisfies that: τ(Cn,n+1)=n+1

Proof

Notice that τ(Cn,n+1)n+1 since {xg:xgis any point ofLgL}{p,q} is a transversal of Cn,n+1. To prove that τ(Pn,Ln)n+1, suppose on the contrary that τ(Pn,Ln)=n. If T is a transversal of cardinality n then TΓ×Γ{e}, i.e., p,qT because, in other case, if pT then, by the Pigeonhole principle, there is a line lqaLq such that Tlqa=, since deg(q)=n, which is a contradiction, unless that qT, which implies that there exists LL such that LT= (because |L|=n1), which is also a contradiction. Therefore TΓ×Γ{e}.

Suppose that: T={(h0,fg0(h0)),,(hn1,fgn1(hn1))},where {h0,,hn1}={g0,,gn1}=Γ and fgi=hi+gie, for i=0,,n1. Then: i=0n1fhi(gi)=i=0n1(gi+hi)=i=0n1gi+i=0n1hi=e,since gΓg=gΓ{e}g=e, which implies that there exists fhj(gj)T that satisfies fhj(gj)=e, which is a contradiction, and consequently τ(Cn,n+1)=n+1.□

Proposition 3.2

The linear system Cn,n+1 satisfies that: ν2(Cn,n+1)=n+1.

Proof

Notice that ν2(Cn,n+1)n+1 because, for any two lines lpg,lphLp, L{lpg,lph} is a 2-packing. To prove that ν2(Cn,n+1)n+1, suppose on the contrary that ν2(Cn,n+1)=n+2, and that R is a maximum 2-packing of size n+2, we analyze two cases:

Case (i): Suppose that R=L{lpa,lpb,lqc}, where lpa,lpbLp and lqcLq; since there is a unique line lpLp which intersects lqc, then we assume that lpalqc. By construction of Cn,n+1 there exists LL that satisfies lpalqcL, inducing a triple point, which is a contradiction.

Case (ii): Let k be an element of Γ{e} and R={lpa,lpb,lqc,lqd}L{Lk} with lpa,lpbLp and lqc,lqdLq, without loss of generality, suppose that lpalqc, lpblqd, lpalqd= and lpblqc=, otherwise, R is not a 2-packing. It is claimed that there exists LL{Lk} such that either lpalqcL or lpblqdL, which implies that R induces a triple point, which is contradiction and hence ν2(Cn,n+1)=n+1. To verify the claim suppose on the contrary that every LL{Lk} satisfies lpalqcL= and lpblqdL=. It means that lpalqcLk and lpblqdLk. By construction of Cn,n+1 it follows that: lpi={(i,x):xΓ{e}}, for all iΓ,lqj={(x,x+j):xΓ{e} and x+je}, for all jΓ, andLk={(x,k):xΓ}.

If lpalqcLk and lpblqdLk, then a+c=b+d=k. On the other hand, as lpalqd= and lpblqc=, then a+d=b+c=e. As a consequence of a+c=b+d=k and a+d=b+c=e we obtain 2k=e, which is a contradiction. Therefore, ν2(Cn,n+1)=n+1.□

Hence, by Propositions 3.1 and 3.2 it was proved that:

Theorem 3.2

Let n=2k+1, with kN, then τ(Cn,n+1)=ν2(Cn,n+1)=n+1,with smallest possible cardinality of lines.

3.1 Straight line systems

A straight line representation on R2 of a linear system (P,L) maps each point xP to a point p(x) of R2, and each line LL to a straight line segment l(L) of R2 in such a way that for each point xP and line LL satisfies p(x)l(L) if and only if xL, and for each pair of distinct lines L,LL satisfies l(L)l(L)={p(x):xLL}. A straight line system (P,L) is a linear system, such that it has a straight line representation on R2. In [Citation12] was proved that the linear system C3,4 is not a straight one. The Levi graph of a linear system (P,L), denoted by B(P,L), is a bipartite graph with vertex set V=PL, where two vertices pP, and LL are adjacent if and only if pL.

In the same way as in [Citation12] and according to [Citation16], any straight line system is Zykov-planar, see also [Citation17]. Zykov proposed to represent the lines of a set system by a subset of the faces of a planar map on R2, i.e., a set system (X,F) is Zykov-planar if there exists a planar graph G (not necessarily a simple graph) such that V(G)=X and G can be drawn in the plane with faces of G two-colored (say red and blue) so that there exists a bijection between the red faces of G and the subsets of F such that a point x is incident with a red face if and only if it is incident with the corresponding subset. In [Citation18] was shown that the Zykov’s definition is equivalent to the following: A set system (X,F) is Zykov-planar if and only if the Levi graph B(X,F) is planar. It is well-known that for any planar graph G the size of G, |E(G)|, is upper bounded by k(|V(G)|2)k2 (see [Citation19] page 135, exercise 9.3.1 (a)), where k is the girth of G (the length of a shortest cycle contained in the graph G). It is not difficult to prove that the Levi graph B(Cn,n+1) of Cn,n+1 is not a planar graph, since the size of the girth of B(Cn,n+1) is 6, it follows: 3n2n=|E(Cn,n+1)|>3(n2+2n1)2,for all n3. Therefore, the linear system Cn,n+1 is not a straight line system.

Finally, as a Corollary of Theorem 2.1, we have the following:

Corollary 3.1

Let (P,L) be a straight line system with p,qP being two points such that deg(p)=Δ(P,L) and deg(q)=max{deg(x):xP{p}}. If|L|deg(p)+deg(q)+ν2(P,L)3, thenτ(P,L)ν2(P,L)1.

4 Intersecting r-uniform linear systems with τ=ν2=r

In this subsection, we give some properties of r-uniform linear systems that satisfy τ=ν2=r as well as a characterization of 4-uniform linear systems with τ=ν2=4.

Let Lr be the family of intersecting linear systems (P,L) of rank r that satisfies τ(P,L)=ν2(P,L)=r, then we have the following lemma:

Lemma 4.1

Each element of Lr is an r-uniform linear system.

Proof

Let us consider (P,L)Lr and lL any line of (P,L). It is clear that T={pl:deg(p)2} is a transversal of (P,L). Hence r=τ(P,L)|T|r, which implies that |l|=r, for all lL. Moreover, deg(p)2, for all pl and lL. □

In [Citation20] was proved the following:

Lemma 4.2

[Citation20] Let (P,L) be anr-uniform intersecting linear system then every edge of (P,L) has at most one vertex of degree 2. Moreover Δ(P,L)r.

Lemma 4.3

[Citation20] Let (P,L) be an r-uniform intersecting linear system then 3(r1)|L|r2r+1.

Hence, by Theorem 2.1 and Lemma 4.3 it follows:

Corollary 4.1

If (P,L)Lr then 3(r1)+1|L|r2r+1.

In [Citation12] was proved that the linear systems (P,L) with |L|>ν2(P,L) and ν2(P,L){2,3,4} satisfy τ(P,L)ν2(P,L); and when they attain the equality, they are a special family of linear subsystems of the projective plane of order 3, Π3 (some of them 4-uniform intersecting linear systems) with transversal and 2-packing numbers equal to 4. Recall that a finite projective plane (or merely projective plane) is a linear system satisfying that any pair of points have a common line, any pair of lines have a common point and there exist four points in general position (there are not three collinear points). It is well known that, if (P,L) is a projective plane, there exists a number qN, called order of projective plane, such that every point (line, respectively) of (P,L) is incident to exactly q+1 lines (points, respectively), and (P,L) contains exactly q2+q+1 points (lines, respectively). In addition to this, it is well known that projective planes of order q, denoted by Πq, exist when q is a power prime. For more information about the existence and the unicity of projective planes see, for instance, Citation[21,22].

Given a linear system (P,L), a triangle T of (P,L), is the linear subsystem of (P,L) induced by three points in general position (non collinear) and the three lines induced by them. In [Citation12] was defined C=(PC,LC) to be the linear system obtained from Π3 by deleting T; also there was defined C4,4 to be the family of linear systems (P,L) with ν2(P,L)=4, such that:

(i)

C is a linear subsystem of (P,L); and

(ii)

(P,L) is a linear subsystem of Π3,

this is C4,4={(P,L):C(P,L)Π3 and ν2(P,L)=4}.

Hence, the authors proved the following:

Theorem 4.1

[Citation12] Let (P,L) be a linear system with ν2(P,L)=4. Then, τ(P,L)=ν2(P,L)=4 if and only if (P,L)C4,4.

Now, consider the projective plane Π3 and a triangle T of Π3 (see (a) of ). Define Cˆ=(PC,LC) to be the linear subsystem induced by LC=LT (see (b) of ). The linear system Cˆ=(PC,LC) just defined has ten points and ten lines. Define Cˆ4,4 to be the family of 4-uniform intersecting linear systems (P,L) with ν2(P,L)=4, such that:

Fig. 2 (a) Projective plane of order 3, Π3 and (b) Linear system obtained from Π3 by deleting the lines of the triangle T.

Fig. 2 (a) Projective plane of order 3, Π3 and (b) Linear system obtained from Π3 by deleting the lines of the triangle T.

(i)

Cˆ is a linear subsystem of (P,L); and

(ii)

(P,L) is a linear subsystem of Π3,

It is clear that Cˆ4,4C4,4 and each linear system (P,L)Cˆ4,4 is a 4-uniform intersecting linear system. Hence

Corollary 4.2

(P,L)L4 if and only if (P,L)Cˆ4,4.

Acknowledgments

The author would like to thank the referees for careful reading and suggestions, which improved the manuscript.

References

  • ChvátalV.McDiarmidC., Small transversal in hypergraphs Combinatorica 12 1 1992 19–26
  • DorflingM.HenningM.A., Linear hypergraphs with large transversal number and maximum degree two European J. Combin. 362014 231–236
  • EckhoffJ., A survey of the Hadwiger-Debrunner (p,q)-problem Discrete and Computational Geometry, Algorithms Combin. Vol, 252003SpringerBerlin347–377
  • ErdösP.Fon-Der-FlaassD.KostochkaA.V.TuzaZ., Small transversals in uniform hypergraphs Siberian Adv. Math. 2 1 1992 82–88
  • HuicocheaM.Jerónimo-CastroJ.MontejanoL.OliverosD., About the piercing number of a family of intervals Discrete Math. 338 12 2015 2545–2548
  • KynčlJ.TancerM., The maximum piercing number for some classes of convex sets with the (4,3)-property Electron. J. Combin. 15 1 2008Research Paper 27, 16
  • MontejanoL.SoberónP., Piercing numbers for balanced and unbalanced families Discrete Comput. Geom. 45 2 2011 358–364
  • NogaA.GilK.MatousekJ.MeshulamR., Transversal numbers for hypergraphs arising in geometry Adv. Appl. Math. 29 1 2002 79–101
  • NogaA.KleitmanD.J., Piercing convex sets Bull. Amer. Math. Soc. (N.S.) 27 2 1992 252–256
  • NogaA.KleitmanD.J., Piercing convex sets and the Hadwiger-Debrunner (p,q)-problem Adv. Math. 96 2 1992 252–256
  • StersoulF., A characterization of the graphs in which the transversal number equals the matching number J. Combin. Theory Ser. B 271979 228–229
  • Araujo-PardoG.MontejanoA.MontejanoL.Vázquez-ÁvilaA., On transversal and 2-packing numbers in straight line systems on R2 Util. Math. 1052017 317–336
  • EustisA.VerstraëteJ., On the independence number of Steiner systems Combin. Probab. Comput. 22 2 2013 241–252
  • C.A. Alfaro, C. Rubio-Montiel, A. Vázquez-Ávila, Covering and 2-packing number in graphs, preprint,https://arxiv.org/abs/1707.02254s.
  • BergeC., Hypergraphs: Combinatorics of Finite Sets1984North-Holland Mathematical LibraryElsevier Science
  • KaufmannM.van KreveldM.SpeckmannB., Subdivision drawings of hypergraphs Graph Drawing2009Berlin: Springer396–407
  • ZykovA.A., Hypergraphs Uspekhi Mat. Nauk 29 6(180) 1974 89–154
  • WalshT.R.S., Hypermaps versus bipartite maps J. Combin. Theory Ser. B 181975 155–163
  • BondyJ.A., Graph Theory With Applications1976Elsevier Science Ltd.Oxford, UK
  • DongY.ShanE.LiS.KangL., Domination in intersecting hypergraphs Discrete Appl. Math. 2512018 155–159
  • BattenL.M., Combinatorics of Finite Geometries1986Cambridge Univ PressCambridge
  • BuekenhoutF., Handbook of Incidence Geometry: Buildings and Foundations1995Elsevier