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?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:2ca94b74aafaec089b5f53658e5b240b5d56e2b08086d2cc7425003c73584a14
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb