Maximizing the number of independent sets of fixed size in Kn‐covered graphs

DOI10.1002/jgt.22733zbMath1522.05218arXiv2002.03189MaRDI QIDQ6056803

Anyao Wang, Boyuan Liu, Yue Ma, Xin Min Hou

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.03189

zbMATH Keywords

independent setextremal graphedge-switching\(H\)-covered graph

Mathematics Subject Classification ID

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

Cites Work

• Two problems on independent sets in graphs
• The spectral radius of graphs without long cycles
• Subgraph coverings and edge switchings
• The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
• Extremal Graphs with Local Covering Conditions
• Maximizing the Number of Independent Sets of a Fixed Size
• Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree

This page was built for publication: Maximizing the number of independent sets of fixed size in Kn‐covered graphs