The Number of Independent Sets in a Regular Graph (Q3557538): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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: THE CAMERON–ERDOS CONJECTURE / 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: Entropy, independent sets and antichains: A new approach to Dedekind’s problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ergodicity of the hard-core model on \(\mathbb{Z}^ 2\) with parity-dependent activities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Percolation and the hard-core lattice gas model / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3104688290 / rank | |||
Normal rank |
Latest revision as of 11:32, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Number of Independent Sets in a Regular Graph |
scientific article |
Statements
The Number of Independent Sets in a Regular Graph (English)
0 references
23 April 2010
0 references
\(d\)-regular bipartite graphs
0 references
0 references