On the number of \(C_ 5's\) in a triangle-free graph (Q1124605)
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: On the number of \(C_ 5's\) in a triangle-free graph |
scientific article; zbMATH DE number 4112630
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of \(C_ 5's\) in a triangle-free graph |
scientific article; zbMATH DE number 4112630 |
Statements
On the number of \(C_ 5's\) in a triangle-free graph (English)
0 references
1989
0 references
The author proves that the number of 5-cycles in a triangle-free graph of order n does not exceed \(c((n+1)/5)^ 5\) where \(c<1.03\). P. Erdős has conjectured bound \((n/5)^ 5\).
0 references
forbidden 3-cycles
0 references
number of 5-cycles
0 references
graph
0 references
0.9561828
0 references
0.9561828
0 references
0.93556666
0 references
0.9279423
0 references
0 references
0.9090891
0 references
0.8963965
0 references
0.8919347
0 references
0.88899094
0 references
