On the number of cycles in 3-connected cubic graphs (Q1386478): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1997.1771 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973765733 / rank | |||
Normal rank | |||
Revision as of 02:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of cycles in 3-connected cubic graphs |
scientific article |
Statements
On the number of cycles in 3-connected cubic graphs (English)
0 references
10 August 1998
0 references
Let \(f(n)\) denote the minimum number of cycles in a 3-connected cubic graph. The authors show that \(f(n)\) is superpolynomial, by showing that for \(n\) sufficiently large, \(2^{n^{0.17}}<f(n)<2^{n^{0.95}}\). This confirms a conjecture by \textit{C. A. Barefoot}, \textit{L. Clark} and \textit{R. Entringer} [Congr. Nummerantium 53, 49-62 (1986; Zbl 0623.05033)].
0 references
number of cycles
0 references
cubic graph
0 references
