A sharp upper bound for the number of stable sets in graphs with given number of cut edges (Q1033025)
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 5626196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sharp upper bound for the number of stable sets in graphs with given number of cut edges |
scientific article; zbMATH DE number 5626196 |
Statements
A sharp upper bound for the number of stable sets in graphs with given number of cut edges (English)
0 references
6 November 2009
0 references
stable set
0 references
cut edge
0 references
2-edge-connected graph
0 references
upper bound
0 references
extremal graph
0 references
0.8143519759178162
0 references
0.7605779767036438
0 references
0.7556555867195129
0 references
0.7537108063697815
0 references
