Minimum spanning hypertrees

DOI10.1016/0166-218X(94)90134-1zbMath0812.68105MaRDI QIDQ1336639

Marius Zimand, Ioan Tomescu

Publication date: 28 November 1994

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

zbMATH Keywords

\(h\)-hypertrees

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Complexity of some graph-based bounds on the probability of a union of events ⋮ Ordered \(h\)-hypertrees

Cites Work

• Hypertrees and Bonferroni inequalities
• Ordered \(h\)-hypertrees
• Bonferroni bounds revisited
• An improved Bonferroni inequality and applications
• Tests of the Kolmogorov-Smirnov type for exponential data with unknown scale, and related problems
• An upper bound for the probability of a union
• A Note on the Bonferroni's Inequalities
• Bounds for the Probability of a Union, with Applications
• On the Distribution of the Maximum of Random Variables
• On Bonferroni-Type Inequalities of the Same Degree for the Probability of Unions and Intersections
• Unnamed Item

This page was built for publication: Minimum spanning hypertrees