Treglown's equitable acyclic colouring conjecture
Statement
Treglown conjectured, in a complementary form, that for every positive integer every digraph with for all has an equitable acyclic -colouring. This implies the acyclic colouring versions of the Hajnal-Szemeredi theorem for digraphs proved by Czygrinow, DeBiasio, Kierstead and Molla, which in turn imply the original Hajnal-Szemeredi theorem for graphs. Proved: a short reduction shows the conjecture follows directly from the original Hajnal-Szemeredi theorem, and a modification of it gives a polynomial-time algorithm for finding such a colouring.
Context
The honest reading, which the paper gives itself: the reduction is implicit in earlier work of Aboulker, Oijid, Petit, Rocton and Simon, and the model itself surfaced that reference when asked about originality. So this establishes the conjecture and supplies a polynomial-time algorithm, while the underlying idea is a rediscovery rather than a first. It is a striking record of a model producing an argument and then correcting the novelty claim made for it.
A named conjecture whose truth implies the digraph acyclic-colouring analogues of Hajnal-Szemeredi, so it sits against a genuinely central classical theorem - but it falls to a short reduction rather than new machinery, and the reduction turns out to be implicit in existing literature. Scored with the resolved specialist problems rather than the long-standing named conjectures.
People
Attempts
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.
The acknowledgements describe the model producing the argument and then correcting its own novelty claim: "The reduction given in this paper arose during a discussion between the first author and ChatGPT 5.6 Sol attempting to locate the bottleneck in extending the results of [3] to prove Conjecture 1.2. Instead of locating the bottleneck, the chatbot gave a clever proof which shows that Conjecture 1.2 reduces to the original Hajnal-Szemeredi theorem. After further discussion about the originality of this idea, the chatbot identified earlier work of Aboulker, Oijid, Petit, Rocton, and Simon" in which the reduction is implicit. The central idea of the paper came from the model, which places it at the discovered tier, with the caveat about priority recorded in the result note.
Reviews
No person has reviewed this attempt. It has not been checked at all.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.