The maximum number of maximum generalized 4‐independent sets in trees

• Published in: Journal of graph theory Vol. 107; no. 2; pp. 359 - 380
• Main Authors: Li, Pingshan, Xu, Min
• Format: Journal Article
• Language: English
• Published: Hoboken Wiley Subscription Services, Inc 01.10.2024
• Subjects: Apexes; Arrays; dissociation sets; Graph theory; König–Egerváry graphs; k‐independent sets; tree; Trees; Trees (mathematics)

A generalized k $k$‐independent set is a set of vertices such that the induced subgraph contains no trees with k $k$‐vertices, and the generalized k $k$‐independence number is the cardinality of a maximum k $k$‐independent set in G $G$. Zito proved that the maximum number of maximum generalized 2‐in...