A bipartite graph with non-unimodal independent set sequence

MaRDI QIDQ396922zbMATH OpenFDO

Authors Arnab Bhattacharyya, J. Kahn

Publication date 14 August 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1301.1752, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i4p11

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

unimodalityindependent sets

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: We show that the independent set sequence of a bipartite graph need not be unimodal.

Cited in

(7)

• The weak Lefschetz property of Artinian algebras associated to paths and cycles
• Log-concavity of some independence polynomials via a partial ordering
• The independent set sequence of some families of trees
• Independent set and matching permutations
• Unimodality of the independence polynomials of non-regular caterpillars
• On the independence polynomial of the corona of graphs
• Maximal-clique partitions and the roller coaster conjecture

This page was built for publication: A bipartite graph with non-unimodal independent set sequence

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