Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Verify

../

linear_intersection/: A separately graded whole-statement review accepts the non-2-colorable intersection theorem and refutes its extension to mere three-colorability, with exact inputs, explicit witnesses and foundational limits retained.

vertex_count/: A separately graded whole-statement review accepts the finite Erdős–Lovász construction, its superquadratic growth and both negative first-question consequences, with exact subjects and limitations.


The report and grade distinguish the non-2-colorable theorem from the false extension to mere three-colorability. Their scopes, foundations, exact inputs and independence limits control the proof coverage.

The vertex-count report and grade cover the explicit construction and superquadratic growth for every integer order at least two, including incident vertices and exact chromatic number three. Together the separate accepted scopes cover both modified questions of Problem 836; their historical-operation and source-fidelity limits remain explicit.