Coupon collecting and transversals of hypergraphs

Marcel Wild; Svante Janson; Stephan Wagner; Dirk Laurie

doi:10.46298/dmtcs.608

Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2013

Coupon collecting and transversals of hypergraphs

(1) , (2) , (1) , (1)

1
2

Marcel Wild

Function : Author

Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]

Svante Janson

Function : Author

Department of Mathematics [Uppsala]

Stephan Wagner

Function : Author

Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]

Dirk Laurie

Function : Author

Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]

Abstract

The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.

Domains

Discrete Mathematics [cs.DM]

Fichier principal

2331-8318-2-PB.pdf (333.77 Ko)

Origin	Files produced by the author(s)

Service Ist Inria Sophia Antipolis-Méditerranée / I3s : Connect in order to contact the contributor

https://inria.hal.science/hal-00980772

Submitted on : Friday, April 18, 2014-4:44:00 PM

Last modification on : Tuesday, February 7, 2023-3:42:44 AM

Long-term archiving on : Monday, April 10, 2017-3:35:24 PM

Dates and versions

hal-00980772 , version 1 (18-04-2014)

Identifiers

HAL Id : hal-00980772 , version 1
DOI : 10.46298/dmtcs.608

Cite

Marcel Wild, Svante Janson, Stephan Wagner, Dirk Laurie. Coupon collecting and transversals of hypergraphs. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 2 (2), pp.259--270. ⟨10.46298/dmtcs.608⟩. ⟨hal-00980772⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

TDS-MACS

134 View

1253 Download

Coupon collecting and transversals of hypergraphs

Abstract

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share