An upper bound for the number of independent sets in regular graphs (Q1045204): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An upper bound for the number of maximal independent sets in a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Independent sets in regular graphs and sum-free subsets of finite groups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matchings and independent sets of a fixed size in regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On weighted graph homomorphisms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3043192 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Entropy Approach to the Hard-Core Model on Bipartite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Information Inequalities for Joint Distributions, With Interpretations and Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3541516 / rank | |||
Normal rank | |||
Latest revision as of 07:57, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the number of independent sets in regular graphs |
scientific article |
Statements
An upper bound for the number of independent sets in regular graphs (English)
0 references
15 December 2009
0 references
independent set
0 references
stable set
0 references
hard-core model
0 references
0 references
