A simple proof for the lower bound of the girth of graphs D(n,q)D(n, q)

preprint2022arXivOpen access

Abstract

The components of the graphs D(n,q)D(n, q) provide the best-known general lower bound for the number of edges in a graph with nn vertices and no cycles of length less than gg. In this paper, we give a new, short, and simpler proof of the fact that the length of the shortest cycle appearing in D(n,q)D(n, q) is n+5n + 5 when nn is odd, and n+4n + 4 when nn is even.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.