A bipartite graph with non-unimodal independent set sequence
Arnab Bhattacharyya, Jeff Kahn
TL;DR
This paper demonstrates that the independent set sequence of bipartite graphs can be non-unimodal, challenging previous assumptions about their structural properties.
Contribution
It provides the first example of bipartite graphs with non-unimodal independent set sequences, revealing new complexity in graph theory.
Findings
Bipartite graphs can have non-unimodal independent set sequences.
Counterexamples to unimodality in bipartite graphs are constructed.
The result impacts understanding of graph invariants and their behaviors.
Abstract
We show that the independent set sequence of a bipartite graph need not be unimodal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.