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

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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete mathematics and theoretical computer science Ročník 23 no. 2, special issue...; číslo Special issues
Hlavní autoři: Bazin, Alexandre, Beaudou, Laurent, Kahn, Giacomo, Khoshkhah, Kaveh
Médium: Journal Article
Jazyk:angličtina
Vydáno: DMTCS 20.04.2023
Discrete Mathematics & Theoretical Computer Science
Témata:
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm]
[math.math-co]mathematics [math]/combinatorics [math.co]
Combinatorics
Computer Science
Discrete Mathematics
hypergraphs
Mathematics
measure and conquer
minimal transversal
Measure and conquer
Hypergraphs
Minimal transversal
ISSN:1365-8050, 1462-7264, 1365-8050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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.4977^n and at most like 1.5012^n.
AbstractList 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.
Author Kahn, Giacomo
Bazin, Alexandre
Khoshkhah, Kaveh
Beaudou, Laurent
Author_xml – sequence: 1
  givenname: Alexandre
  orcidid: 0000-0002-4268-8961
  surname: Bazin
  fullname: Bazin, Alexandre
  organization: WEB Architecture x Semantic WEB x WEB of Data
– sequence: 2
  givenname: Laurent
  surname: Beaudou
  fullname: Beaudou, Laurent
  organization: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes
– sequence: 3
  givenname: Giacomo
  orcidid: 0000-0002-2889-4435
  surname: Kahn
  fullname: Kahn, Giacomo
  organization: Décision et Information pour les Systèmes de Production
– sequence: 4
  givenname: Kaveh
  surname: Khoshkhah
  fullname: Khoshkhah, Kaveh
  organization: Institute of Computer Science [University of Tartu, Estonie]
BackLink https://hal.science/hal-01847459$$DView record in HAL
BookMark eNptkUtrGzEUhUVxIY92lT8w2xAmvRq9ZpZJSGOD22yStbijkWyZsWSkcSD_vrKdQlu6ug--e-6Bc0FmIQZLyBWFWy6brv02bCeTbxVtuk_knDIp6hYEzP7oz8hFzhuAgnB1Tp7v4z4MPqyqaW2rn_ttb1MVXfXDB7_FsXpJGPKbTRnHXPlQZr_DNPnJVqx-Dd7FtK3m7zubVgl36_yFfHYFtV8_6iV5_f748jCvl89Pi4e7ZW2aVnS1aih3Cp0Dq5zpmbFNw5iSYLlCKQbRNUBb4ajgorNAZesABRjHwCiDLbski5PuEHGjd6mYTe86otfHRUwrfbBpRqu7hkk5WGMBkPPe9ANQ4A6d7FmHvSxa1yetNY5_Sc3vlvqwK1a4KkbeVGHpiTUp5pys08ZPOPkYpoR-1BT0MQl9TEIfkig3N__c_H7yP_oXsdyMpg
CitedBy_id crossref_primary_10_1016_j_ijar_2023_109067
ContentType Journal Article
Copyright licence_http://creativecommons.org/publicdomain/zero
Copyright_xml – notice: licence_http://creativecommons.org/publicdomain/zero
DBID AAYXX
CITATION
1XC
VOOES
DOA
DOI 10.46298/dmtcs.7129
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DOAJ
DatabaseTitle CrossRef
DatabaseTitleList

CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
ExternalDocumentID oai_doaj_org_article_92366dece00a44bcbd0104faf6b39ab6
oai:HAL:hal-01847459v7
10_46298_dmtcs_7129
GroupedDBID -~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
AAYXX
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADQAK
AENEX
AFFHD
AFKRA
AFPKN
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
B0M
BAIFH
BBTPI
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
IBB
ICD
ITC
J9A
KQ8
KWQ
L6V
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
PV9
REM
RNS
RSU
RZL
TR2
TUS
XSB
~8M
1XC
VOOES
ID FETCH-LOGICAL-c2859-7214f7aff0e7fcb3ce2233760e47a65d5920185f15459e0168f0a50cf30c7ca83
IEDL.DBID DOA
ISSN 1365-8050
1462-7264
IngestDate Mon Nov 10 04:31:49 EST 2025
Tue Dec 02 06:20:56 EST 2025
Sat Nov 29 02:48:26 EST 2025
Tue Nov 18 20:58:06 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Special issues
Keywords Measure and conquer
Hypergraphs
Minimal transversal
Language English
License https://creativecommons.org/licenses/by/4.0
licence_http://creativecommons.org/publicdomain/zero/: http://creativecommons.org/publicdomain/zero
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2859-7214f7aff0e7fcb3ce2233760e47a65d5920185f15459e0168f0a50cf30c7ca83
ORCID 0000-0002-2889-4435
0000-0002-4268-8961
0000-0003-1959-6855
OpenAccessLink https://doaj.org/article/92366dece00a44bcbd0104faf6b39ab6
ParticipantIDs doaj_primary_oai_doaj_org_article_92366dece00a44bcbd0104faf6b39ab6
hal_primary_oai_HAL_hal_01847459v7
crossref_citationtrail_10_46298_dmtcs_7129
crossref_primary_10_46298_dmtcs_7129
PublicationCentury 2000
PublicationDate 2023-04-20
PublicationDateYYYYMMDD 2023-04-20
PublicationDate_xml – month: 04
  year: 2023
  text: 2023-04-20
  day: 20
PublicationDecade 2020
PublicationTitle Discrete mathematics and theoretical computer science
PublicationYear 2023
Publisher DMTCS
Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: DMTCS
– name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
ssib044734695
Score 2.278008
Snippet 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...
SourceID doaj
hal
crossref
SourceType Open Website
Open Access Repository
Enrichment Source
Index Database
SubjectTerms [info.info-dm]computer science [cs]/discrete mathematics [cs.dm]
[math.math-co]mathematics [math]/combinatorics [math.co]
Combinatorics
Computer Science
Discrete Mathematics
hypergraphs
Mathematics
measure and conquer
minimal transversal
Title Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
URI https://hal.science/hal-01847459
https://doaj.org/article/92366dece00a44bcbd0104faf6b39ab6
Volume 23 no. 2, special issue...
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: DOA
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center)
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044734695
  issn: 1365-8050
  databaseCode: M~E
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Continental Europe Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BFMQW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/conteurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central Database Suite (ProQuest)
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: PIMPY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEB5EPejBt7i-COJJqHabbJMeVZQV3HUPCnoqzQsLWmV39ehvdybtrgqCFy-FhpA2MwnfN3l8A3DYFiZJteeR4s5jgOIUzjmpI2TO2kgubGqDZP617PfV_X02-Jbqi86E1fLAteFOkICkqXXGxXEhhDbaUgThC59qnhU6iG0j65kEU83-QZIJWd_GE2mSqRP7PDajY9kOTPILf4JMP6LK42QVNaDK5QosNXSQnda_sQozrlqD5UmqBdbMvDVY7E3lVUfrcHNGyZAQdBgWsn5I6sFePOuVVfmMzQUAovMWOLZYWeF7-Uo9HTvGI2SZRFRZFyPQYdCrHm3A3eXF7Xk3ajIjRIYE5yIM24SXhfexk95obhyiPB1vcUIWacd2MsR11fHEjzKHrE75uOjExvPYSFMovgmz1UvltoB5zq3R3rct1yLxSpHgPJISWi92mbUtOJrYKzeNbDhlr3jKMXwIxs2DcXMybgsOp5Vfa7WM36udkeGnVUjiOhSg4_PG8flfjm_BAbrtRxvd0-ucyrDvQmLP3-X2f3xpBxYoyTztISXxLsyOh29uD-bN-7gcDffDwMNn7-NiH-YGV73BwydS2eJk
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Bounding+the+Number+of+Minimal+Transversals+in+Tripartite+3-Uniform+Hypergraphs&rft.jtitle=Discrete+mathematics+and+theoretical+computer+science&rft.au=Alexandre+Bazin&rft.au=Laurent+Beaudou&rft.au=Giacomo+Kahn&rft.au=Kaveh+Khoshkhah&rft.date=2023-04-20&rft.pub=Discrete+Mathematics+%26+Theoretical+Computer+Science&rft.eissn=1365-8050&rft.volume=23+no.+2%2C+special+issue...&rft.issue=Special+issues&rft_id=info:doi/10.46298%2Fdmtcs.7129&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_92366dece00a44bcbd0104faf6b39ab6
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon