Bipartite graphs can have any number of independent sets

DOI10.1016/0012-365X(89)90306-3zbMath0681.05068MaRDI QIDQ1823265

Yanyan Li

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphstable setindependent sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (11)

Graphs, partitions and Fibonacci numbers ⋮ On an extremal inverse problem in graph theory ⋮ Constraints on the number of maximal independent sets in graphs ⋮ Cacti with the maximum Merrifield-Simmons index and given number of cut edges ⋮ Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ Unicycle graphs with extremal Merrifield-Simmons index ⋮ The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices ⋮ Independent sets in graphs ⋮ The inverse problem for certain tree parameters ⋮ A sharp upper bound for the number of stable sets in graphs with given number of cut edges ⋮ The number of maximal independent sets in connected triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Bipartite graphs can have any number of independent sets