Counting odd cycles in locally dense graphs (Q401486)
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: Counting odd cycles in locally dense graphs |
scientific article; zbMATH DE number 6334631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting odd cycles in locally dense graphs |
scientific article; zbMATH DE number 6334631 |
Statements
Counting odd cycles in locally dense graphs (English)
0 references
27 August 2014
0 references
graph homomorphisms
0 references
\((\varepsilon, d)\)-dense graphs
0 references
odd cycles
0 references
Sidorenko's conjecture
0 references
0.90412486
0 references
0.88569665
0 references
0.8856584
0 references
0.88111246
0 references
0.87514323
0 references
