Bivalent trees and forests or upper bounds for the probability of a union revisited

DOI10.1016/0166-218X(83)90070-7zbMath0514.60018MaRDI QIDQ1051331

Willi Maurer

Publication date: 1983

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

zbMATH Keywords

matroid theorybivalent graphprobability of a union

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (2)

Tight Probability Bounds with Pairwise Independence ⋮ Correlation polytopes: Their geometry and complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tests of the Kolmogorov-Smirnov type for exponential data with unknown scale, and related problems
• Best Linear Bonferroni Bounds
• An upper bound for the probability of a union
• Best Possible Inequalities for the Probability of a Logical Function of Events
• On acyclic simplicial complexes
• Bounds for the Probability of a Union, with Applications
• On the theory of graphs

This page was built for publication: Bivalent trees and forests or upper bounds for the probability of a union revisited