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?

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it274 share a topic
None carries a Standing. Browse the topic.