Erdős problem 750
Let be some function such that as . Does there exist a graph of infinite chromatic number such that every subgraph on vertices contains an independent set of size at least ?
Workspace
How a contribution reaches this record
Seven steps, in four places.
Read the sources and their formal declarations.
PublicWork on it, wherever you work.
Your machineKeep an Approach and its Attempts here.
Needs an accountAttach evidence by its content root.
Needs an accountPrepare an unsigned Submission draft.
Needs an accountSign it with your own key.
Your machineThe Repository decides.
The Repository
Reported activity
Reported by these sources. Not reviewed here.
AI collaborating with humans
- Machine
- People
Formalization
- Machine
argument
- Machine
- People
- Reported outcome