The blog post links a pdf that OpenAI put together of nine mathematicians that commented on the proof. Each is quite brief and written in accessible terms (or more accessible terms, at least). https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29a...

There's pages of comments from like 8 mathematicians in the attached pdf

No separate Wikipedia page -> just another Erdős problem.

There is no universally agreed-upon "central" conjecture (like "P vs. NP" in CS), but here are some pillars:

1) https://en.wikipedia.org/wiki/Happy_ending_problem

2) https://en.wikipedia.org/wiki/Hadwiger_conjecture_(combinato...

3) https://en.wikipedia.org/wiki/Hirsch_conjecture

There may be years of investigation as to how far you can generalize these methods. As to how central it is, it's a longstanding problem that Erdos loves to cite for that branch of math.

The thing is is that it seems a lot of the effort through the years (which is unquantifiable in scale as to how much time was spent and how many people focused their entire worklives on it if any) has gone for trying to look for the proof, and the search for the disproof seems minimal.