Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

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

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read Online Read More Add to Saved list
  • Additional Information
    • Abstract:
      For some given graph H, a graph G is called H‐covered if each vertex in G is contained in a copy of H. In this note, we determine the maximum number of independent sets of size t≥3 in N‐vertex Kn‐covered graphs and classify the extremal graphs. The result answers a question proposed by Chakraborti and Loh. The proof uses an edge‐switching operation on hypergraphs which never increases the number of independent sets. [ABSTRACT FROM AUTHOR]
    • Abstract:
      Copyright of Journal of Graph Theory is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)