On transversal and 2-packing numbers in uniform linear systems
From MaRDI portal
Publication:5154597
Abstract: A linear system is a pair where is a family of subsets on a ground finite set , such that , for every . The elements of and 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 of points of is a transversal of if intersects any line, and the transversal number, , is the minimum order of a transversal. On the other hand, a 2-packing set of a linear system is a set of lines, such that any three of them have a common point, then the 2-packing number of , , is the size of a maximum 2-packing set. It is known that the transversal number is bounded above by a quadratic function of . An open problem is to haracterize the families of linear systems which satisfies , for some . In this paper, we give an infinite family of linear systems which satisfies with smallest possible cardinality of , as well as some properties of -uniform intersecting linear systems , such that . Moreover, we state a characterization of -uniform intersecting linear systems with .
Recommendations
- A note on a problem of Henning and Yeo about the transversal number of uniform linear systems whose 2-packing number is fixed
- On transversal and 2-packing numbers in straight line systems on \({\mathbb R}^2\)
- On transversal numbers of intersecting straight line systems and intersecting segment systems
- A note on domination in intersecting linear system
- Transversals in 4-uniform linear hypergraphs
Cites work
- scientific article; zbMATH DE number 3984003 (Why is no real title available?)
- scientific article; zbMATH DE number 743695 (Why is no real title available?)
- scientific article; zbMATH DE number 2209723 (Why is no real title available?)
- A characterization of the graphs in which the transversal number equals the matching number
- About the piercing number of a family of intervals
- Domination in intersecting hypergraphs
- Graph theory with applications
- HYPERGRAPHS
- Hypermaps versus bipartite maps
- Linear hypergraphs with large transversal number and maximum degree two
- On the independence number of Steiner systems
- On transversal and 2-packing numbers in straight line systems on \({\mathbb R}^2\)
- Piercing convex sets
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Piercing numbers for balanced and unbalanced families
- Small transversals in hypergraphs
- Small transversals in uniform hypergraphs
- Subdivision Drawings of Hypergraphs
- The maximum piercing number for some classes of convex sets with the \((4,3)\)-property
- Transversal numbers for hypergraphs arising in geometry
Cited in
(6)- On transversal numbers of intersecting straight line systems and intersecting segment systems
- On transversal and 2-packing numbers in straight line systems on \({\mathbb R}^2\)
- On domination and 2-packing numbers in intersecting linear systems.
- A note on domination in intersecting linear system
- A note on a problem of Henning and Yeo about the transversal number of uniform linear systems whose 2-packing number is fixed
- On intersecting straight line systems
This page was built for publication: On transversal and 2-packing numbers in uniform linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154597)