Join
Explicit Ramsey graphs
Construct explicit graphs on n vertices with no clique or independent set of size c·log n, matching Erdős's random graphs.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.