Problem detail · source-aware

Kaul-Mudrock Conjecture on the Unlabeled List Color Function

resolvedconfidence 70%

VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.

Precise statement

Donner proved in 1992 that the list color function $P_\ell(G,k)$ equals the chromatic polynomial $P(G,k)$ once $k$ is large. Kaul and Mudrock asked whether the analogue holds for Hanlon's unlabeled chromatic polynomial, and could not settle even the edgeless graph, which they posed as a conjecture. The conjecture is true, and it implies that a disconnected graph satisfies the unlabeled analogue of Donner's result whenever all of its components do.

The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.

What AI did

ChatGPT 5.5 Pro

As part of an experiment, Gowers asked ChatGPT 5.5 Pro to find an open combinatorics problem it considered approachable and try to solve it. The model picked this conjecture unprompted and produced an affirmative proof, which Gowers passed to the authors and they confirmed correct. The authors had reached the same theorem independently by a shifting argument, so the model does not hold priority, but its proof is genuinely different (a shadow inequality in the style of the local LYM inequality) and appears in the appendix. Its output also revealed the general form of Corollary 1.6, which the authors had previously established only for complete graphs. Asked to settle the underlying question for all graphs, the model could not.

Provider: OpenAI · Prompt public: unknown · Independence: unknown

Verification boundary

unreviewed

The authors state that they checked the AI-produced proof and found it correct, and they include a cleaned-up version of it in Appendix A. arXiv preprint; not yet peer-reviewed.

Correctness: unknown · statement fidelity: unaudited · peer review: none

Timeline

  1. arXiv:2607.16810 - The unlabeled list color function of disconnected graphs

    VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.

Known method families

argument (source-reported)

Source-reported tools: argument.

Independent: unknown · difference confidence: 0

What remains uncertain

VibeMath has not independently audited the mathematical statement, proof, or novelty claim.

  • VibeMath has not independently verified the mathematical claim.
  • AI-attempt independence and training-data exposure are unknown unless explicitly documented.
  • VibeMath has not independently audited the mathematical statement, proof, or novelty claim.