A coding perspective on the lower bound for diagonal Ramsey numbers
Sundar Vishwanathan
TL;DR
This paper presents a coding-based perspective on Erdős's lower bound for diagonal Ramsey numbers, offering new insights into this combinatorial problem.
Contribution
It introduces a novel coding approach to analyze and understand the lower bounds of diagonal Ramsey numbers, building on Erdős's foundational work.
Findings
Provides a new coding perspective on Ramsey numbers
Offers potential for tighter bounds or new proofs
Enhances understanding of combinatorial lower bounds
Abstract
We give a coding based perspective, on a result of Erd\'{o}s, on a lower bound for the diagonal ramsey numbers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research