DeepAI AI Chat
Log In Sign Up

Short rainbow cycles in sparse graphs

06/03/2018
by   Matt DeVos, et al.
Simon Fraser University
Universidad Nacional Autonoma de Mexico
0

Let G be a simple n-vertex graph and c be a colouring of E(G) with n colours, where each colour class has size at least 2. We prove that G contains a rainbow cycle of length at most n/2, which is best possible. Our result settles a special case of a strengthening of the Caccetta-Häggkvist conjecture, due to Aharoni. We also show that the matroid generalization of our main result also holds for cographic matroids, but fails for binary matroids.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/15/2022

Notes on Aharoni's rainbow cycle conjecture

In 2017, Ron Aharoni made the following conjecture about rainbow cycles ...
12/12/2022

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

In 2017, Aharoni proposed the following generalization of the Caccetta-H...
01/14/2020

Strong coloring 2-regular graphs: Cycle restrictions and partial colorings

Let H be a graph with Δ(H) ≤ 2, and let G be obtained from H by gluing i...
07/12/2019

On a Generalization of the Marriage Problem

We present a generalization of the marriage problem underlying Hall's fa...
07/15/2020

Further results on Hendry's Conjecture

Recently, a conjecture due to Hendry was disproved which stated that eve...
07/16/2022

A family of counterexamples for a conjecture of Berge on α-diperfect digraphs

Let D be a digraph. A stable set S of D and a path partition 𝒫 of D are ...
12/09/2018

Low Congestion Cycle Covers and their Applications

A cycle cover of a bridgeless graph G is a collection of simple cycles i...