Skip to content

Erdős problem 75

Start work

Is there a graph of chromatic number ℵ_ 1 with ℵ_ 1 vertices such that for all ε > 0, if n is sufficiently large and H is a subgraph on n vertices, then H contains an independent set of size > n ^ (1 - ε)?

Workspace

Continue locallyOpen sourceSign in to contribute

Opens this exact Problem and source revision in Workbench. Nothing is cloned, uploaded, or executed.

How a contribution reaches this record

Seven steps, in four places.

  1. Read the sources and their formal declarations.

    Public

  2. Work on it, wherever you work.

    Your machine

  3. Keep an Approach and its Attempts here.

    Needs an account

  4. Attach evidence by its content root.

    Needs an account

  5. Prepare an unsigned Submission draft.

    Needs an account

  6. Sign it with your own key.

    Your machine

  7. The Repository decides.

    The Repository

Reported activity

Reported by these sources. Not reviewed here.