ProbXiv
sign in
unchecked

Erdos's Question on the Independence Ratio of Unit-Distance Graphs

Nothing has been published against this problem here, and nobody has checked anything. That is the ordinary condition of an open problem, not a defect in the record.

unit-distance-independence-ratioGeometry & topologyposed by Paul Erdosrecorded: solved

1 attempt · no person has looked

Statement

Erdos asked whether a finite unit-distance graph in the plane can have independence ratio below 1/41/4. One exists, built on the geometric fractional chromatic number framework of Matolcsi, Ruzsa, Varga and Zsamboki plus a carefully chosen two-vertex augmentation.

Context

A question of Erdos in the Hadwiger-Nelson circle, where the independence ratio bound is a standard measure of progress on colouring the plane.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt

  • #1

    Attempt 1

    computationChatGPT, Codex (GPT-5.5) with Akos Ducz, Daniel Varga ·
    AI involvement
    ai assisted
    a person led the work and used a model along the way.
    models
    ChatGPT, Codex (GPT-5.5)
    people
    Akos Ducz, Daniel Varga

    The models were used for software development including code drafting and debugging, plus improvement and formatting suggestions. The search that produces the graph is computational, so the tooling is load-bearing even though no mathematical step is attributed.

    Reviews

    0 human reviews · 0 machine checks

    No person has reviewed this attempt. It has not been checked at all.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.