Title

Edges In Graphs With Large Girth

Abstract

Several upper bounds are given for the maximum number of edges e possible in a graph depending upon its order p, girth g and, in certain cases, minimum degree δ. In particular, one upper bound has an asymptotic order of p1+2/(g-1) when g is odd. A corollary of our final result is that {Mathematical expression} when k = ⌊e/p⌋ ≥ 2. Asymptotic and numerical comparisons are also presented. © 1991 Springer-Verlag.

Publication Date

12-1-1991

Publication Title

Graphs and Combinatorics

Volume

7

Issue

4

Number of Pages

315-321

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1007/BF01787638

Socpus ID

0013019859 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0013019859

This document is currently not available here.

Share

COinS