Computational lower limits on small Ramsey numbers
Eugene Kuznetsov
TL;DR
This paper reviews computational methods for establishing lower bounds on small Ramsey numbers, reproduces known bounds, and reports new results through systematic analysis of cyclic Ramsey graphs.
Contribution
It provides a comprehensive review and introduces new lower bounds for small Ramsey numbers using computational approaches.
Findings
Reproduced many known lower bounds.
Reported several new bounds.
Systematic review of cyclic Ramsey graphs.
Abstract
Computer-based attempts to construct lower bounds for small Ramsey numbers are discussed. A systematic review of cyclic Ramsey graphs is attempted. Many known lower bounds are reproduced. Several new bounds are reported.
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