Skip to content

Erdős problem 71

Is it true that for every infinite arithmetic progression PP which contains even numbers there is some constant c=c(P)c=c(P) such that every graph with average degree at least cc contains a cycle whose length is in PP?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:041c2cadb4762c062b6a594b13f2fc9a2e2edebbaac64aba2557c782b45c8de4
Metadata
sha256:d39d44d34e6595e58150f7d4e34759c1094ade8a4b2e0d0a6e97bda920464bd1
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:2ca94b74aafaec089b5f53658e5b240b5d56e2b08086d2cc7425003c73584a14
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page