Minimizing the number of independent sets in triangle-free regular graphs (Q1690246)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6827515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of independent sets in triangle-free regular graphs |
scientific article; zbMATH DE number 6827515 |
Statements
Minimizing the number of independent sets in triangle-free regular graphs (English)
0 references
19 January 2018
0 references
independent sets
0 references
occupancy fraction
0 references
hard-core model
0 references
0.8467761874198914
0 references
0.8323161005973816
0 references
0.8097386956214905
0 references
0.8012309074401855
0 references
0.7973823547363281
0 references
