A coding perspective on the lower bound for diagonal Ramsey numbers
Combinatorics
2021-05-04 v2
Abstract
We give a coding based perspective, on a result of Erd\'{o}s, on a lower bound for the diagonal ramsey numbers.
Keywords
Cite
@article{arxiv.2104.13109,
title = {A coding perspective on the lower bound for diagonal Ramsey numbers},
author = {Sundar Vishwanathan},
journal= {arXiv preprint arXiv:2104.13109},
year = {2021}
}
Comments
The result appears on page 463 of the fourth edition of the book, Introduction to Kolmogorov Complexity and its applications, by M. Li and P. Vitanyi