Aug 1, 2009 · 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 ...

This thesis focuses on the problem of finding the maximum number of pair-wise connections between the nodes in a network, given the number of nodes and the ...

In 1975, Erdo{combining double acute accent}s proposed the problem of determining the extremal numbers ex (n ; 4) of a graph of n vertices and girth at least 5.

Innovative studies on largely overlooked aspects of Paracelsianism along with an extensive catalogue of Paracelsian forgeries make this volume an essential ...

Journal of Graph Theory, 1992. Let f(v) denote the maximum number of edges in a graph of order v and of girth at least 5. In this paper, we discuss ...

Charles Delorme, Evelyne Flandrin, Yuqing Lin , Mirka Miller, Joe Ryan: On Extremal Graphs with Bounded Girth. Electron. Notes Discret. Math.

On the Structure of Extremal Graphs of High Girth ... Is it possible to decrease the exponential (in n) lower bound on v in Theorem 4 to a polynomial one?

Abstract. We show that any n-vertex extremal graph G without cycles of length at most k has girth exactly k+1 if k ≥ 6 and n > (2(k−2)k−2 +k−5)/(k−3).

Sep 26, 2015 · For example, given that a graph G has diameter D, maximum degree Δ and even girth g, what is an upper bound on the number of vertices of G? In ...

Girth refers to the length of the shortest cycle in a graph. In the context of extremal combinatorics, girth is an important concept as it helps to ...