Academics

Essentially tight bounds for rainbow cycles in proper edge-colourings

Time:2024-03-12 Tue 17:05:00-18:15:00

Venue:ZOOM:787 662 9899 BIMSA

Organizer:Benjamin Sudakov

Speaker:Matija Bucic Princeton University

Abstract

An edge-coloured graph is said to be rainbow if it uses no colour more than once. Extremalproblems involving rainbow objects have been a focus of much research as they capture theessence of a number of interesting problems in a variety of areas. A particularly intensively studiedguestion due to Keevash, Mubayi, Sudakov and Verstrate from 2007 asks for the maximumpossible average degree of a properly edge-coloured graph on n vertices without a rainbow cycle.Improving upon a series of earlier bounds, Tomon proved an upper bound of (log n)(2+o(1)) for thisguestion. Very recently, Janzer-Sudakov and Kim-Lee-Liu-Tran independently removed the o(1)term in Tomon's bound. We show that the answer to the question is equal to (log n)(1+o(1)). Jointwork with: Noga Alon, Lisa Sauermann, Dmitrii Zakharov and Or Zamir.


Speaker Intro

Matia Bucic is an Assistant professor in Mathematics at Princeton University. Before his currentposition, he studied at the University of Cambridge, received his PhD from ETH Zurich, and held aVeblen Research Instructorship, a joint position between lAS and Princeton. His research focuseson extremal and probabilistic combinatorics, as well as their applications to other areas ofcombinatorics and computer science.

DATEMarch 12, 2024
SHARE
Related News
    • 0

      Tight Hamilton cycles with high discrepancy | Research seminar in Discrete Mathematics

      AbstractIn discrepancy theory, the basic question is whether a structure can be partitioned in a balancedway, or if there is always some discrepancy no matter how the partition is made.in the context ofgraph theory, a well-studied question is whether for a given host graph, any 2-colouring of its edgesmust contain a specified subgraph "with high discrepancy", meaning that within this subgraph o...

    • 1

      Bounds for standard L-functions

      AbstractWe consider the standard L-function attached to a cuspidal automorphic representation of a general linear group. We present a proof of a subconvex bound in the t-aspect. More generally, we address the spectral aspect in the case of uniform parameter growth. These results are the subject of the third paper linked below, building on the first two.SpeakerPaul Nelson works in Analytic Numbe...