Extremal combinatorics February 03, 2023 EDT

ccby-4.0 Photo by
Mettfluencer Mett Lifestyle
on
Unsplash

Tight Ramsey bounds for multiple copies of a graph

Tight Ramsey bounds for multiple copies of a graph

Bucić, Matija, and Benny Sudakov. 2023. “Tight Ramsey Bounds for Multiple Copies of a Graph.”

*Advances in Combinatorics*, February. https://doi.org/10.19086/aic.2023.1.