A note on the Tuza constant $c_k$ for small $k$
Yun-Shan Lu, Hung-Lung Wang

TL;DR
This paper investigates the Tuza constant $c_k$ for small $k$, providing improved bounds for certain values, enhancing understanding of hypergraph transversal ratios.
Contribution
It offers new upper and lower bounds on the Tuza constant $c_k$ for specific small values of $k$, improving previous results.
Findings
Upper bound on $c_k$ for $k extgreater=7$ is improved.
Lower bound on $c_k$ is improved for $k=7,8,10,11,13,14,17$.
Abstract
For a hypergraph , the transversal is a subset of vertices whose intersection with every edge is nonempty. The cardinality of a minimum transversal is the transversal number of , denoted by . The Tuza constant is defined as , where ranges over all -uniform hypergraphs, with and being the number of edges and vertices, respectively. We give an upper bound and a lower bound on . The upper bound improves the known ones for , and the lower bound improves the known ones for .
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 · Limits and Structures in Graph Theory · Advanced Graph Theory Research
