Few \(H\) copies in \(F\)-saturated graphs (Q5066892)
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: Few H copies in F-saturated graphs |
scientific article; zbMATH DE number 7500662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Few \(H\) copies in \(F\)-saturated graphs |
scientific article; zbMATH DE number 7500662 |
Statements
Few <i>H</i> copies in <i>F</i>‐saturated graphs (English)
0 references
31 March 2022
0 references
extremal graph theory
0 references
graph saturation
0 references
0.8495721817016602
0 references
0.8450102806091309
0 references
0.826945960521698
0 references
0.8243886232376099
0 references
