No label defined (Q4500709)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1496607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1496607 |
Statements
28 November 2001
0 references
girth
0 references
minimum degree
0 references
circumference
0 references
longest circuit
0 references
0.894766092300415
0 references
0.8835246562957764
0 references
0.8245314359664917
0 references
A new lower bound on circumference (the length of a longest circuit) \(c(G)\) of a graph \(G\) in terms of girth \(g\) and minimum degree \(\delta\) of \(G\) is obtained in this paper as follows: \[ c(G) \geq \delta (\delta -1) ^ {\lfloor (g-3)/4 \rfloor} (p + 4/(\delta -2)) - g - 8/(\delta -2) \] where \(p \in \{ 1,2,3,4\}\) and \(p \equiv g+2\) (mod(4)). This new bound improves a few earlier results by Voss, Peyrat and Zhang.
0 references
