Some bounds on the size of maximum G-free sets in graphs (Q6174763)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some bounds on the size of maximum G-free sets in graphs |
scientific article; zbMATH DE number 7713053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some bounds on the size of maximum G-free sets in graphs |
scientific article; zbMATH DE number 7713053 |
Statements
Some bounds on the size of maximum G-free sets in graphs (English)
0 references
15 July 2023
0 references
independence number
0 references
\(G\)-free coloring
0 references
forest number
0 references
\(G\)-free subset
0 references
0.7997961044311523
0 references
0.7753264904022217
0 references
0.7562724947929382
0 references
0.7515429854393005
0 references
0.7482765913009644
0 references
