MathOverflow

Wikipedia says:
On July 10, 2026, OpenAI released a preprint claiming a positive resolution of the conjecture, the proof of which they claim was generated by its GPT 5.6 large language model.
Has any graph theorist verified this purported proof?

The Godel sentence is a formula ~p(G(~p(n))) [Breathwait 1931] , // a.k.a a formula of an unprovabilty predicate with a free variable, substituted with a composite numerical reference G(~p(n)) to a formula ~p(n). // The composite reference function G...

I am looking for an exposition of this theory that includes its foundations, the construction of pure Hodge structures and the proof of the hard Lefschetz theorem for intersection cohomology, as well as the decomposition theorem. Background material...

It is a well known fact that, with the exception of $n = 2$ and $n = 3$, it is possible to place $n$ queens on an $n \times n$ chessboard that cannot attack each other.
The fact that the queens cannot attack each other boils down to the fact that there are no more than $1$ queens on any $0^{\circ}$ horizontal line, no more than $1$ queens on any $90^{\circ}$ vertical line, no more than $1$ queens on any $45^{\circ}...