\(d\)-disjunct matrices: Bounds and Lovász local lemma

DOI10.1016/S0012-365X(01)00452-6zbMath1002.05010OpenAlexW2004480678WikidataQ124962487 ScholiaQ124962487MaRDI QIDQ1613522

Hong-Gwa Yeh

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00452-6

zbMATH Keywords

probabilistic methodgroup testingStein-Chen methodLovász local lemma\(d\)-disjunct matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (including graph drawing) in computer science (68R10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (2)

An extension of Stein-Lovász theorem and some of its applications ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.

This page was built for publication: \(d\)-disjunct matrices: Bounds and Lovász local lemma