A bipartite graph with non-unimodal independent set sequence
From MaRDI portal
Publication:396922
zbMATH Open1295.05172arXiv1301.1752MaRDI QIDQ396922FDOQ396922
Authors: Arnab Bhattacharyya, J. Kahn 
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: We show that the independent set sequence of a bipartite graph need not be unimodal.
Full work available at URL: https://arxiv.org/abs/1301.1752
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (7)
- Independent set and matching permutations
- On the independence polynomial of the corona of graphs
- Unimodality of the independence polynomials of non-regular caterpillars
- Log-concavity of some independence polynomials via a partial ordering
- The weak Lefschetz property of Artinian algebras associated to paths and cycles
- Maximal-clique partitions and the roller coaster conjecture
- The independent set sequence of some families of trees
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)
