Finding defective coins

DOI10.1007/BF01864175MaRDI QIDQ1112024zbMATH OpenOpenAlexFDO

Authors Laszló Pyber

Publication date 1988

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01864175

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Review text

The author corrects in this note the proof of Lemma 2.1 of his earlier paper [Graphs Comb. 2, 173-177 (1986; Zbl 0593.05002)].

Cites work

• Families of finite sets in which no set is covered by the union of \(r\) others
• How to find many counterfeit coins?
• scientific article; zbMATH DE number 4043100 (Why is no real title available?)

Cited in

(1)

• Selecting two different defective coins

This page was built for publication: Finding defective coins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112024)