On the number of \(C_ 5's\) in a triangle-free graph
type: Item
instance of: scholarly article
title: On the number of \(C_ 5's\) in a triangle-free graph
zbMATH Open document ID: 0679.05042
DOI: 10.1007/BF02122689
published in: Combinatorica
publication date: 1989-01-01T00:00:00Z
review text: 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\).
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4112630
zbMATH Keywords: forbidden 3-cycles
zbMATH Keywords: number of 5-cycles
zbMATH Keywords: graph
author: Ervin Győri
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf02122689
OpenAlex ID: W2148929061
Recommended article: A note on the maximum number of triangles in a \(C_5\)-free graph
Recommended article: A note on the maximum number of triangles in a C5‐free graph
Recommended article: On the maximum number of five-cycles in a triangle-free graph
Recommended article: On the number of pentagons in triangle-free graphs
Recommended article: Triangles in C5‐free graphs and hypergraphs of girth six
Recommended article: On the minimum number of edges in triangle-free 5-critical graphs
Recommended article: Q3470479
Recommended article: The maximum number of triangles in \(C_{2k+1}\)-free graphs
Recommended article: On the minimum edge-density of 5-critical triangle-free graphs
Recommended article: On a Class of P 5 -Free Graphs
description: scientific article; zbMATH DE number 4112630