University of Cambridge > Talks.cam > Discrete Analysis Seminar > An exponential upper bound on induced Ramsey numbers

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

An exponential upper bound on induced Ramsey numbers

Download to your calendar using vCal

  • UserMarcelo Campos (IMPA)
  • ClockWednesday 22 October 2025, 13:30-14:30
  • HouseMR4, 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) ≤ 2Ck. 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:

Note that ex-directory lists are not shown.

Other lists

Webinar & LT2, Computer Laboratory, William Gates Building. FW11, Computer Laboratory, William Gates Builiding in person & via zoom

Other talks

Title to be confirmed An Amphibious Urbanism | | Cut 4: The Desert Arrives Slowly Group Presentation 4 Morning Break Afternoon Break Quantum graphs with a time asymmetry: spectral optimization and spectral statistics
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity