Maximizing the number of independent sets of fixed size in connected graphs with given independence number

DOI10.1007/s00373-017-1825-0zbMath1395.05129MaRDI QIDQ1684927

Peng Zhang

Publication date: 12 December 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1825-0

zbMATH Keywords

independence number; independent set; connected graph; extremal graph theory; Turán connected graph

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C30: Enumeration in graph theory

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

05C40: Connectivity