AI Chat AI Image Generator AI Video Text to Speech

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

07/24/2018

∙

by Alexandre Bazin, et al.

∙

∙

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 | .

Alexandre Bazin
5 publications
Laurent Beaudou
6 publications
Giacomo Kahn
6 publications
Kaveh Khoshkhah
2 publications

page 1

page 2

page 3

page 4

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...

0 Chong Shangguan, et al. ∙

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)...

0 Jesse Geneson, et al. ∙

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...

0 Changxin Wang, et al. ∙

research

∙ 02/03/2019

Study, representation and applications of hypergraph minimal transversals

This work is part of the field of the hypergraph theory and focuses on h...

0 M. Nidhal Jelassi, et al. ∙

research

∙ 07/25/2020

Bounding the trace function of a hypergraph with applications

An upper bound on the trace function of a hypergraph H is derived and it...

0 Farhad Shahrokhi, et al. ∙

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...

0 Farhad Shahrokhi, et al. ∙

research

∙ 03/11/2019

Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices

In this paper we investigate density conditions for finding a complete r...

0 Klas Markström, et al. ∙