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).
University of Tartu (University of Tartu, Ülikooli 18, 50090 TARTU - Estonia)
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.
https://hal.archives-ouvertes.fr/hal-01847459 Contributor : Giacomo KahnConnect 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
Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah. Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. 2022. ⟨hal-01847459v5⟩