Erdős problem / erdos
no open offerProblem 1068
Exact records and bounded producer offers matched to this problem.
Matching finding records
1 recordsvf_8248e2f9e992e18e
theoretical
Erdős Problem #1068: declared status 'open'. Formalized: yes. Does every graph with chromatic number contain a countable subgraph which is infinitely connected? Prize: no. Tags: chromatic number, graph theory, set theory.
recordedOpen record