A generalization of Hunter's bound to hypergraphs

Simple item page
dc.contributor.authorKovacs, Gergely
dc.contributor.authorVizvari, Bela
dc.date.accessioned2026-02-06T18:34:17Z
dc.date.issued2025
dc.departmentDoğu Akdeniz Üniversitesi
dc.description.abstractOne of the primary objectives of this paper is to generalize Hunter's bound to m-regular hypergraphs. In particular, new upper and lower bounds for the probability of the union of events is provided in this paper. The lower bounds generalize Hunter's bound as well. All new bounds are derived from the dual feasible solutions of Boole's linear programming problem.
dc.identifier.doi10.1007/s10479-018-2869-0
dc.identifier.endpage1177
dc.identifier.issn0254-5330
dc.identifier.issn1572-9338
dc.identifier.issue3
dc.identifier.orcid0000-0002-1349-1035
dc.identifier.scopus2-s2.0-85046469609
dc.identifier.scopusqualityQ1
dc.identifier.startpage1171
dc.identifier.urihttps://doi.org/10.1007/s10479-018-2869-0
dc.identifier.urihttps://hdl.handle.net/11129/11727
dc.identifier.volume354
dc.identifier.wosWOS:001639379300013
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer
dc.relation.ispartofAnnals of Operations Research
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectHunter's bound
dc.subjectProbability of union of events
dc.subjectLower and upper bound
dc.titleA generalization of Hunter's bound to hypergraphs
dc.typeArticle

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu