Printable PDF
Department of Mathematics,
Department of Mathematics,
University of California San Diego
****************************
Math 269: Combinatorics
Zion Hefty
University of Denver
Improving Ramsey R(3,k) in just two bites
Abstract:
The Ramsey number R(t, k) is the smallest n such that any red-blue edge coloring of the n-vertex complete graph has either a t-vertex red complete subgraph or a kvertex blue complete subgraph. We will investigate the history of asymptotic bounds on the extreme off-diagonal Ramsey number R(3, k), and present a new lower bound that has been conjectured to be asymptotically tight. Based on joint work with Paul Horn, Dylan King, Florian Pfender.
January 20, 2026
2:00 PM
APM 7321
Research Areas
Combinatorics Probability Theory****************************
