Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

Abstract : We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications. In this paper we prove that this number grows at least like 1:4977n and at most like 1:5012n.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01847459
Contributor : Giacomo Kahn Connect in order to contact the contributor
Submitted on : Friday, January 28, 2022 - 10:17:49 AM
Last modification on : Sunday, January 30, 2022 - 3:27:03 AM

File

Bounding_the_Number_of_Minimal...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01847459, version 5
  • ARXIV : 1807.09030

Citation

Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah. Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. 2022. ⟨hal-01847459v5⟩

Share

Metrics

Record views

344

Files downloads

265