DOAJ Open Access 2023

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

Alexandre Bazin Laurent Beaudou Giacomo Kahn Kaveh Khoshkhah

Lihat Sumber DOI

Abstrak

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.4977^n and at most like 1.5012^n.

Topik & Kata Kunci

Mathematics

Penulis (4)

Alexandre Bazin

Laurent Beaudou

Giacomo Kahn

Kaveh Khoshkhah

Format Sitasi

APA MLA BibTeX

Bazin, A., Beaudou, L., Kahn, G., Khoshkhah, K. (2023). Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs. https://doi.org/10.46298/dmtcs.7129

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.7129

Informasi Jurnal

Tahun Terbit: 2023
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.7129
Akses: Open Access ✓