An extension of the Win theorem: counting the number of maximum independent sets

DOI10.1007/S11401-019-0141-9zbMath1415.05081OpenAlexW2942825434MaRDI QIDQ2002161

Yanyan Li

Publication date: 11 July 2019

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11401-019-0141-9

zbMATH Keywords

connectivitymaximum independent set\(k\)-ended tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Factors and factorizations of graphs. Proof techniques in factor theory
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning trees with bounded degrees
• Long cycles in triangle-free graphs with prescribed independence number and connectivity
• A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs
• Extensions and consequences of Chvátal-Erdös' theorem
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets
• A note on Hamiltonian circuits
• Circumferences of k-connected graphs involving independence numbers
• Chvátal–Erdős Theorem: Old Theorem with New Aspects

This page was built for publication: An extension of the Win theorem: counting the number of maximum independent sets