# Tony Huynh, Aharoni’s rainbow cycle conjecture holds up to an additive constant

## May 7 Tuesday @ 4:30 PM - 5:30 PM KST

Room B332,
IBS (기초과학연구원)

In 2017, Aharoni proposed the following generalization of the Caccetta-Häggkvist conjecture for digraphs. If G is a simple n-vertex edge-colored graph with n color classes of size at least r, then G contains a rainbow cycle of length at most ⌈n/r⌉.

In this talk, we prove that Aharoni’s conjecture holds up to an additive constant. Specifically, we show that for each fixed r, there exists a constant c such that if G is a simple n-vertex edge-colored graph with n color classes of size at least r, then G contains a rainbow cycle of length at most n/r+c.

This is joint work with Patrick Hompe.