On extremal graphs with bounded girth

Delorme, Charles and Flandrin, Evelyne and Lin, Yuqing and Miller, Mirka and Ryan, Joe (2009) On extremal graphs with bounded girth. Electronic Notes in Discrete Mathematics, 34 .

Full text not available from this repository.


By the extremal number ex(n;t) = ex(n;{C�,C�,�,Ct}) we denote the maximum size (number of edges) in a graph of n vertices, n > t, and girth (length of shortest cycle) at least g � t + 1. In 1975, Erd�s proposed the problem of determining the extremal numbers ex(n;4) of a graph of n vertices and girth at least 5. In this paper, we consider a generalized version of this problem, for t � 5. In particular, we prove that ex(n;6) for n = 29, 30 and 31 is equal to 45, 47 and 49, respectively.

Item Type: Article
Uncontrolled Keywords: extremal graph, extremal number, forbidden cycles, size, girth
Depositing User: Dr David Allingham
Date Deposited: 28 Sep 2012 12:05
Last Modified: 28 Sep 2012 12:05

Actions (login required)

View Item