On the probability that subset sequences are minimal

DOI10.1016/S0012-365X(99)00112-0zbMATH Open0938.05002OpenAlexW2018436100WikidataQ126816942 ScholiaQ126816942MaRDI QIDQ1817583FDOQ1817583

Anthony J. Macula, Dung Le

Publication date: 27 June 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00112-0

zbMATH Keywords

probabilityrepresentative\(k\)-setssequence of sets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40) Extremal combinatorics (05D99)

Cited In (2)

• On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence
• On sets not belonging to algebras

   Recommendations

• Probabilities for Intersecting Systems and Random Subsets of Finite Sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Minimal completely separating systems of \(k\)-sets 👍 👎
• Random minimal coverings of sets 👍 👎
• Representatives for Finite Sets 👍 👎

This page was built for publication: On the probability that subset sequences are minimal

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