| Autor: |
Alexandre Bazin, Laurent Beaudou, Giacomo Kahn, Kaveh Khoshkhah |
| Jazyk: |
angličtina |
| Rok vydání: |
2023 |
| Předmět: |
|
| Zdroj: |
Discrete Mathematics & Theoretical Computer Science, Vol vol. 23 no. 2, special issue..., Iss Special issues (2023) |
| Druh dokumentu: |
article |
| ISSN: |
1365-8050 |
| DOI: |
10.46298/dmtcs.7129 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
