Skip to main content
Log in

On The Number Of Sets Of Cycle Lengths

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

A set S of integers is called a cycle set on {1, 2, . . .,n} if there exists a graph G on n vertices such that the set of lengths of cycles in G is S. Erdős conjectured that the number of cycle sets on {1, 2, . . .,n} is o(2n). In this paper, we verify this conjecture by proving that there exists an absolute constant c ≥ 0.1 such that the number of cycle sets on {1, 2, . . .,n} is \( o{\left( {2^{{n - n^{c} }} } \right)} \).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jacques Verstraëte.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Verstraëte, J. On The Number Of Sets Of Cycle Lengths. Combinatorica 24, 719–730 (2004). https://doi.org/10.1007/s00493-004-0043-6

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-004-0043-6

Mathematics Subject Classification (2000):

Navigation