Abstract
The components of the graphs provide the best-known general lower bound for the number of edges in a graph with vertices and no cycles of length less than . In this paper, we give a new, short, and simpler proof of the fact that the length of the shortest cycle appearing in is when is odd, and when is even.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.