Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
On the maximum number of C5's in a triangle-free graph
Home
Publications
On the maximum number of C5's in a triangle-free graph
On the maximum number of C5's in a triangle-free graph
Author:
AG
Andrzej Grzesik
Andrzej Grzesik
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Preprint
Publisher website
Google Scholar
4 February 2011
preprint
Published by
arXiv
in
arXiv
DOI:
https://doi.org/10.48550/arXiv.1102.0962
Abstract
We show that a triangle-free graph on n vertices contains at most (n/5)^5 cycles of length five. It settles in the affirmative a conjecture of Erdos.
Keywords
VERTICES CONTAINS
MAXIMUM NUMBER
TRIANGLE FREE
CONJECTURE
FREE GRAPH
ERDOS
GRAPH
C5'S
N/5
All Related Versions
Version 1, 2011-02-04, ArXiv
Version 2, 2011-02-09, ArXiv
Version 3, 2012-04-03, ArXiv
Related articles
Scroll to top