Maximising the number of cycles in graphs with forbidden subgraphs (Q2222049)
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 7305045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximising the number of cycles in graphs with forbidden subgraphs |
scientific article; zbMATH DE number 7305045 |
Statements
Maximising the number of cycles in graphs with forbidden subgraphs (English)
0 references
3 February 2021
0 references
cycles
0 references
H-free graphs
0 references
Turán graphs
0 references
extremal numbers
0 references
0 references
0.8051176071166992
0 references
0.7884636521339417
0 references
0.7875148057937622
0 references
0.7822098135948181
0 references
0.7820852398872375
0 references
