Bounding the trace function of a hypergraph with applications

07/25/2020
by   Farhad Shahrokhi, et al.
0

An upper bound on the trace function of a hypergraph H is derived and its applications are demonstrated. For instance, a new upper bound for the VC dimension of H, or vc(H), follows as a consequence and can be used to compute vc(H) in polynomial time provided that H has bounded degeneracy. This was not previously known. Particularly, when H is a hypergraph arising from closed neighborhoods of a graph, this approach asymptotically improves the time complexity of the previous result for computing vc(H). Another consequence is a general lower bound on the distinguishing transversal number of H that gives rise to applications in domination theory of graphs. To effectively apply the methods developed here, one needs to have good estimations of degeneracy, and its variation or reduced degeneracy which is introduced here.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2019

A simple upper bound for trace function of a hypergraph with applications

Let H=(V, E) be a hypergraph on the vertex set V and edge set E⊆ 2^V. We...
research
07/24/2018

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs

We bound the number of minimal hypergraph transversals that arise in tri...
research
02/15/2019

Universally Sparse Hypergraphs with Applications to Coding Theory

For fixed integers r> 2,e> 2,v> r+1, an r-uniform hypergraph is called G...
research
11/12/2020

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Cut and spectral sparsification of graphs have numerous applications, in...
research
12/19/2021

On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs

Erdős and Purdy, and later Agarwal and Sharir, conjectured that any set ...
research
06/10/2023

Linear saturation numbers of Berge-C_3 and Berge-C_4

The linear saturation number sat^lin_k(n,ℱ) (linear extremal number ex^l...
research
04/30/2020

The Complexity of Dynamic Data Race Prediction

Writing concurrent programs is notoriously hard due to scheduling non-de...

Please sign up or login with your details

Forgot password? Click here to reset