A note on the Tuza constant c_k for small k

06/29/2022
by   Yun-Shan Lu, et al.
0

For a hypergraph H, 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 H, denoted by τ(H). The Tuza constant c_k is defined as supτ(H)/ (m+n), where H ranges over all k-uniform hypergrpahs, with m and n being the number of edges and vertices, respectively. We give upper and lower bounds on c_k, for 7≤ k≤ 17.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2023

Shallow Hitting Edge Sets in Uniform Hypergraphs

A subset M of the edges of a graph or hypergraph is hitting if M covers ...
research
02/13/2020

A generalization of the Kővári-Sós-Turán theorem

We present a new proof of the Kővári-Sós-Turán theorem that ex(n, K_s,t)...
research
08/12/2019

Hyperedge Estimation using Polylogarithmic Subset Queries

A hypergraph H is a set system (U( H), F(H)), where U( H) denotes the s...
research
02/24/2018

On Pseudo-disk Hypergraphs

Let F be a family of pseudo-disks in the plane, and P be a finite subset...
research
12/21/2021

Counting Simplices in Hypergraph Streams

We consider the problem of space-efficiently estimating the number of si...
research
10/01/2019

The Minimization of Random Hypergraphs

We investigate the maximum-entropy model B_n,m,p for random n-vertex, m-...
research
09/06/2023

Controllability Backbone in Networks

This paper studies the controllability backbone problem in dynamical net...

Please sign up or login with your details

Forgot password? Click here to reset