Wiki
Wiki

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

Updated

Claims

../

2025_09_26_aragao_campos_dahia_filipe_marciano: Theorem 1.1 of the 2025 preprint gives an absolute constant C with R*(G) at most 2^(Cn) for every graph G on n vertices, so the answer is yes; unrefereed, accepted by the site and attested in Morris's ICM 2026 text.