Title

Edges In Graphs With Large Girth

Authors

Authors

R. D. Dutton;R. C. Brigham

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Graphs Comb.

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 delta. 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 g less-than-or-equal-to 2 + 2 log(k) (p/4) when k = [e/p] greater-than-or-equal-to 2. Asymptotic and numerical comparisons are also presented.

Journal Title

Graphs and Combinatorics

Volume

7

Issue/Number

4

Publication Date

1-1-1991

Document Type

Article

DOI Link

http://dx.doi.org/10.1007/bf01787638

Language

English

First Page

315

Last Page

321

WOS Identifier

WOS:A1991GW77700002

ISSN

0911-0119

Recommended Citation

"Edges In Graphs With Large Girth" (1991). Faculty Bibliography 1990s. 221.
https://stars.library.ucf.edu/facultybib1990/221