On the number of \(C_ 5's\) in a triangle-free graph (Q1124605): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02122689 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148929061 / rank | |||
Normal rank | |||
Latest revision as of 08:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of \(C_ 5's\) in a triangle-free graph |
scientific article |
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
