A question of Erdős and Hajnal [ErHa68b], who proved that for every finite $k$ there is a graph with chromatic number $\aleph_1$ and $\aleph_k$ vertices where each subgraph on less than $\aleph_k$ vertices has chromatic number $\leq \aleph_0$.

How a contribution reaches this record

Seven steps, in four places.

1. 1

   Read the sources and their formal declarations.

   Public
2. 2

   Work on it, wherever you work.

   Your machine
3. 3

   Keep an Approach and its Attempts here.

   Needs an account
4. 4

   Attach evidence by its content root.

   Needs an account
5. 5

   Prepare an unsigned Submission draft.

   Needs an account
6. 6

   Sign it with your own key.

   Your machine
7. 7

   The Repository decides.

   The Repository