On a problem of Henning and Yeo about the transversal number of uniform linear systems whose 2-packing number is fixed
Carlos A. Alfaro, Adri\'an V\'azquez-\'Avila

TL;DR
This paper investigates the relationship between the transversal number and the 2-packing number in r-uniform linear systems, providing new results that support a conjectured inequality for systems with fixed 2-packing number.
Contribution
It offers new results on r-uniform linear systems with fixed 2-packing number, confirming the inequality proposed by Henning and Yeo in specific cases.
Findings
Supports the inequality for certain r-uniform linear systems with fixed 2-packing number.
Provides bounds and conditions under which the transversal number satisfies the conjectured inequality.
Advances understanding of the combinatorial properties of linear systems in hypergraph theory.
Abstract
A linear system is a pair where is a family of subsets on a ground finite set such that , for every . If all elements of of a linear system , then the linear system is called -uniform linear system. The transversal number of a linear system , , is the minimum cardinality of a subset satisfying , for every . The 2-packing number of a linear system , , is the maximum cardinality of a subset such that, any three elements of don't have a common point (are triplewise disjoint), that is, if three elements are chosen in , then they are not incidents in a common point. For , let…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Graph Theory Research · Limits and Structures in Graph Theory
