An exponential upper bound on induced Ramsey numbers

Add to your list(s) Download to your calendar using vCal

• Marcelo Campos (IMPA)
• Wednesday 22 October 2025, 13:30-14:30
• MR4, CMS.

If you have a question about this talk, please contact Julia Wolf.

The induced Ramsey number R_ind(H) of a graph H is the minimum number N such that there exists a graph with N vertices for which all red/blue colorings of its edges contain a monochromatic induced copy of H. In this talk I’ll show there exists an absolute constant C > 0 such that, for every graph H on k vertices, these numbers satisfy R_ind(H) ≤ 2^Ck. This resolves a conjecture of Erdős from 1975.

This is joint work with Lucas Aragão, Gabriel Dahia, Rafael Filipe, João Marciano.

This talk is part of the Discrete Analysis Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Discrete Analysis Seminar
• Hanchen DaDaDash
• Interested Talks
• MR4, CMS
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.