๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Indecomposable cycles on special quartics in P3

โœ Scribed by Jaya N. Iyer

Publisher
Springer
Year
2003
Tongue
English
Weight
149 KB
Volume
111
Category
Article
ISSN
0025-2611

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Cycles in 3-Connected Graphs
On Cycles in 3-Connected Graphs
โœ Hao Li ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 156 KB
On the Number of Cycles in 3-Connected C
On the Number of Cycles in 3-Connected Cubic Graphs
โœ R.E.L Aldred; Carsten Thomassen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie