Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Coupon collecting an ...
Article

Coupon collecting and transversals of hypergraphs

Marcel Wild (1) (2), Svante Janson (3), Stephan Wagner (1) (2), Dirk Laurie (1) (2)
(1) Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]
(2) Department of Mathematical Sciences [Stellenbosch University]
(3) Department of Mathematics [Uppsala]
Download article
Open on HAL
Imported on
November 20, 2012
Published on
September 8, 2013
Last modified on
March 31, 2025
Volume 15
vol. 15:2
Analysis of Algorithms
DOI
10.46298/dmtcs.608
License
https://about.hal.science/hal-authorisation-v1
Indicators
1041
Views
1013
Downloads

Coupon collecting and transversals of hypergraphs

Marcel Wild (1) (2), Svante Janson (3), Stephan Wagner (1) (2), Dirk Laurie (1) (2)
(1) Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]
(2) Department of Mathematical Sciences [Stellenbosch University]
(3) Department of Mathematics [Uppsala]
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • Compression with wildcards: All exact or all minimal hitting sets

    Open Mathematics

    Authors : Marcel Wild ORCID

    Journal reference : Volume 21, 2023, pp.

    DOI : 10.1515/math-2022-0596

  • Coupon Collector Problem with Reset Button

    Mathematics

    Authors : Jelena Jocković ORCID, Bojana Todić

    Journal reference : Volume 12, 2024, pp. 239

    DOI : 10.3390/math12020239

  • Markov chain approach to the coupon collector problem with universal coupon

    Filomat

    Authors : Jelena Jockovic, Bojana Todic

    Journal reference : Volume 38, 2024, pp. 8565-8581

    DOI : 10.2298/fil2424565j
Preview
Loading PDF preview...