Non-Stanley bounds for network reliability

DOI10.1023/A:1022484229443zbMath0846.05046OpenAlexW2069741057MaRDI QIDQ1906250

Jason I. Brown, Charles J. Colbourn

Publication date: 17 March 1996

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022484229443

zbMATH Keywords

probabilityboundsmatroidsconnected graphnetwork reliability\(H\)-vectors

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35) Combinatorial aspects of matroids and geometric lattices (05B35) Applications of graph theory to circuits and networks (94C15)

Related Items (3)

The \(k\)-fractal of a simplicial complex ⋮ Chip firing and all-terminal network reliability bounds ⋮ Chromatic polynomials and order ideals of monomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid Steiner problems, the Tutte polynomial and network reliability
• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• Face number inequalities for matroid complexes and Cohen-Macaulay types of Stanley-Reisner rings of distributive lattices
• On the log concavity of reliability and matroidal sequences
• A Set System Polynomial with Colouring and Reliability Applications
• Least reliable networks and the reliability domination
• Roots of the Reliability Polynomials
• Bounds on the Reliability Polynomial for Shellable Independence Systems
• Network transformations and bounding network reliability
• Combinatorics and commutative algebra

This page was built for publication: Non-Stanley bounds for network reliability