Skip to content

Erdős Problem 1068 #1109

@mo271

Description

@mo271

What is the conjecture

https://www.erdosproblems.com/1068

Does every graph with chromatic number $\aleph_1$ contain a countable subgraph which is infinitely connected?

Status: open

Choose either option

  • I plan on working on this conjecture
  • This issue is up for grabs: I would like to see this conjecture added by somebody else

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions