Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
Combinatorics
2021-01-08 v3 Discrete Mathematics
Abstract
We bound the number of minimal hypergraph transversals that arise in tri-partite 3-uniform hypergraphs, a class commonly found in applications dealing with data. Let H be such a hypergraph on a set of vertices V. We give a lower bound of 1.4977 |V | and an upper bound of 1.5012 |V | .
Keywords
Cite
@article{arxiv.1807.09030,
title = {Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs},
author = {Alexandre Bazin and Laurent Beaudou and Giacomo Kahn and Kaveh Khoshkhah},
journal= {arXiv preprint arXiv:1807.09030},
year = {2021}
}