加入
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.
Update from the catalog #1
已合并
Construct explicit graphs on n vertices with no clique or independent set of size c·log n, matching Erdős's random graphs.