The unlabeled list color function of disconnected graphs

Hemanshu Kaul, Jeffrey A. Mudrock, Armin Straub

Appendix A proves that choosing one element from each of n sets of size k yields at least binomial(k+n−1,n) distinct multisets, using a multiset-shadow coupling. This establishes the edgeless-graph case of the unlabeled list-color conjecture.

Sources for this record

What was already known

The human authors had independently proved the edgeless case by a different generating-function and shifting argument before receiving the model proof.

AI involvement AI-autonomous

At Gowers's broad prompt to choose an approachable open combinatorics problem, ChatGPT 5.5 Pro selected this conjecture and produced an affirmative proof. Its retained key idea is a probabilistic coupling proving a multiset-shadow inequality, unlike the authors' proof.

The model selected the problem from a broad request and generated the alternative proof without reported human mathematical hints.

Importance Modest

Adds a checked, distinct proof of a useful special case and some disconnected-graph consequences.

Limitations

The all-graphs conjecture remains open. The human authors’ separate proof and graph applications are credited to them.

Technical verification Formal (human)

The human authors expressly confirmed correctness of the AI-produced Appendix A proof and printed its full argument. This is a source-reported complete human proof check, not an AIProofWatch reproduction.

Formal checking

Reviewed the AI proof for correctness and paraphrased the complete argument

Checker
The first two paper authors
Scope
The Appendix A multiset-shadow proof of Theorem 1.5
Basis
Reported by the linked checker
Evidence source

Checking a formal statement does not establish that it matches the original problem.

Human understanding Full

The authors explain the AI proof's probabilistic multiset-shadow coupling and how it differs from their own shifting/generating-function proof.

Correction and publication history

2026-10-18 · publication

Adds a checked, distinct proof of a useful special case and some disconnected-graph consequences.

Read this published revision