加载中…
We review Exoo’s 1989 paper, which demonstrates that a lower bound for the Ramsey number is . We provide an efficient way to verify the claims in the paper, adding detailed proofs. In particular, we replace the reference to computer verification by concise arguments. Using our understanding of the insight behind these proofs, we are also able to analyse variations of the graph constructions to obtain, for example, colourings of which have very few monochromatic .

生成讲解博客的中文版本

生成AI智能校验的中文版本