TL;DR
This paper advances the understanding of Ramsey numbers for specific graph structures like books and wheels, providing new bounds and exact values using diverse computational and theoretical methods.
Contribution
It presents new upper and lower bounds, including exact values for certain Ramsey numbers involving wheels and books, employing multiple innovative techniques.
Findings
Established $R(W_5, W_7) = 15$
Proved $R(W_5, W_9) = 18$
Derived bounds for generalized Ramsey numbers $GR(r,K_s,t)$
Abstract
In this work, we give several new upper and lower bounds on Ramsey numbers for books and wheels, including a tight upper bound establishing , matching upper and lower bounds giving , , and , and a number of additional tight lower bounds for books. We use a range of different methods: flag algebras, local search, bottom-up generation, and enumeration of polycirculant graphs. We also explore generalized Ramsey numbers using similar methods. Let denote the minimum number of vertices such that any -edge-coloring of has a copy of with at most colors. We establish , and some additional bounds.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
