BIMSA > Research seminar in Discrete Mathematics Odd-Ramsey Numbers of Hamilton Cycles
Odd-Ramsey Numbers of Hamilton Cycles
Organizers
Jie Ma , Benjamin Sudakov
Speaker
Shagnik Das
Time
Tuesday, September 30, 2025 5:05 PM - 6:15 PM
Venue
Online
Online
Zoom 787 662 9899 (BIMSA)
Abstract
Introduced by Noga Alon in his work on graph codes, the odd-Ramsey number r(n,H) of a graph H is the smallest r such that there is an r-edge-colouring of K_n in which every copy of H has a colour that appears an odd number of times. In this talk, we continue the ongoing investigation of this graph parameter, determining the order of magnitude of the odd-Ramsey number of the Hamilton cycle C_n. Time permitting, we shall also discuss some initial results in a sparser setting, where we edge-colour Dirac graphs.
This is joint work with Simona Boyadzhiyska, Thomas Lesgourgues, and Kalina Petrova.