Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture

From MaRDI portal
(Redirected from Publication:6080148)



Abstract: For a digraph G and vinV(G), let delta+(v) be the number of out-neighbors of v in G. The Caccetta-H"{a}ggkvist conjecture states that for all kge1, if G is a digraph with n=|V(G)| such that delta+(v)gek for all vinV(G), then G contains a directed cycle of length at most lceiln/kceil. Aharoni proposed a generalization of this conjecture, that a simple edge-colored graph on n vertices with n color classes, each of size at least k, has a rainbow cycle of length at most lceiln/kceil. Let be emph{triangular} if a simple edge-colored graph on n vertices with at least alphan color classes, each with at least edges, must have a rainbow triangle. Aharoni, Holzman, and DeVos showed the following: (9/8,1/3) is triangular; and (1,2/5) is triangular. In this paper, we improve those bounds, showing the following: (1.1077,1/3) is triangular; and (1,0.3988) is triangular.












This page was built for publication: Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080148)