On the unimodality of the independent set numbers of a class of matroids

DOI10.1016/0095-8956(85)90038-3zbMath0554.05016OpenAlexW2002121287MaRDI QIDQ759757

Carolyn R. Mahoney

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487238163203965

zbMATH Keywords

independent set numberspolygon matroids of outerplanar graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

Correlation bounds for fields and matroids ⋮ On the independence numbers of a matroid ⋮ Lorentzian polynomials ⋮ A strong log-concavity property for measures on Boolean algebras ⋮ Roots of independence polynomials of well covered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two combinatorial applications of the Aleksandrov-Fenchel inequalities
• Logarithmic concavity for edge lattices of graphs
• On the points-lines-planes conjecture
• Topology of series-parallel networks
• On the Independent Set Numbers of a Finite Matroid
• Whitney Number Inequalities for Geometric Lattices
• A Theorem on Reciprocal Polynomials with Applications to Permutations and Compositions
• The Slimmest Geometric Lattices
• A Combinatorial Model for Series-Parallel Networks
• Distinct representatives of subsets
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: On the unimodality of the independent set numbers of a class of matroids