A Set System Polynomial with Colouring and Reliability Applications

DOI10.1137/0401017MaRDI QIDQ3792257zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Jason I. Brown

Publication date 1988

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0401017

zbMATH Keywords

broken circuit complexchromatic polynomialhypergraphslogarithmic concavitymatroidreliability polynomialsset systemshellable complexunimodal sequenceWhitney polynomial

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Enumeration in graph theory (05C30) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4053686
• Chromatic polynomials and network reliability
• You May Rely on the Reliability Polynomial for Much More Than You Might Think
• scientific article; zbMATH DE number 3947973
• Generalized activities and K-terminal reliability. II

Cited in

(4)

• Generalized activities and K-terminal reliability. II
• Polychromatic sets and its application in simulating complex objects and systems
• Non-Stanley bounds for network reliability
• On the reliability roots of simplicial complexes and matroids

This page was built for publication: A Set System Polynomial with Colouring and Reliability Applications

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