Pages that link to "Item:Q1077437"
From MaRDI portal
The following pages link to Hypertrees and Bonferroni inequalities (Q1077437):
Displaying 13 items.
- Subset complement addition upper bounds. An improved inclusion-exclusion method (Q920504) (← links)
- Bonferroni-type inequalities and binomially bounded functions (Q966030) (← links)
- Two packing problems on \(k\)-matroid trees (Q1178033) (← links)
- Ordered \(h\)-hypertrees (Q1199491) (← links)
- Minimum spanning hypertrees (Q1336639) (← links)
- Hypergraphs and sharpened sieve inequalities (Q1336651) (← links)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- A contribution to the chromatic theory of uniform hypergraphs (Q1896647) (← links)
- Computing bounds for the probability of the union of events by different methods (Q1945070) (← links)
- Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints (Q2341243) (← links)
- Improved Bonferroni Inequalities and Binomially Bounded Functions (Q3439569) (← links)
- Probability bounds given by hypercherry trees (Q4709731) (← links)
- Polynomially Computable Bounds for the Probability of the Union of Events (Q5247622) (← links)