ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is there a graph GG with vertex set ω22\omega_2^2 and chromatic number ℵ2\aleph_2 such that every subgraph whose vertices have a lesser type has chromatic number ≤ℵ0\leq \aleph_0? What if instead we ask for GG to have chromatic number ℵ1\aleph_1?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.