Aharoni's rainbow cycle conjecture holds up to an additive constant

12/12/2022
by   Patrick Hompe, et al.
0

In 2017, Aharoni proposed the following generalization of the Caccetta-Häggkvist conjecture: 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 paper, we prove that, for fixed r, Aharoni's conjecture holds up to an additive constant. Specifically, we show that for each fixed r ≥ 1, there exists a constant c_r 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_r.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2022

Notes on Aharoni's rainbow cycle conjecture

In 2017, Ron Aharoni made the following conjecture about rainbow cycles ...
research
10/24/2017

The Erdős-Hajnal conjecture for caterpillars and their complements

The celebrated Erdős-Hajnal conjecture states that for every proper here...
research
06/03/2018

Short rainbow cycles in sparse graphs

Let G be a simple n-vertex graph and c be a colouring of E(G) with n col...
research
07/17/2020

Dominated Minimal Separators are Tame (Nearly All Others are Feral)

A class F of graphs is called tame if there exists a constant k so that ...
research
02/07/2022

Longest Cycle above Erdős-Gallai Bound

In 1959, Erdős and Gallai proved that every graph G with average vertex ...
research
09/05/2018

A completion of the proof of the Edge-statistics Conjecture

For given integers k and ł with 0<ℓ< k 2, Alon, Hefetz, Krivelevich and...
research
03/16/2021

A Hamilton Cycle in the k-Sided Pancake Network

We present a Hamilton cycle in the k-sided pancake network and four comb...

Please sign up or login with your details

Forgot password? Click here to reset