On the log concavity of reliability and matroidal sequences
From MaRDI portal
Publication:1325759
DOI10.1006/aama.1994.1004zbMath0802.05024OpenAlexW1963878765MaRDI QIDQ1325759
Jason I. Brown, Charles J. Colbourn
Publication date: 3 July 1994
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.1994.1004
Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial probability (60C05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Non-Stanley bounds for network reliability ⋮ Roots of two‐terminal reliability polynomials ⋮ \( h\)-vectors of matroids and logarithmic concavity ⋮ Graphs with a minimal number of convex sets ⋮ Chip firing and all-terminal network reliability bounds ⋮ Roots of independence polynomials of well covered graphs
