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 and , let be the number of out-neighbors of in . The Caccetta-H"{a}ggkvist conjecture states that for all , if is a digraph with such that for all , then contains a directed cycle of length at most . Aharoni proposed a generalization of this conjecture, that a simple edge-colored graph on vertices with color classes, each of size at least , has a rainbow cycle of length at most . Let be emph{triangular} if a simple edge-colored graph on vertices with at least color classes, each with at least edges, must have a rainbow triangle. Aharoni, Holzman, and DeVos showed the following: is triangular; and is triangular. In this paper, we improve those bounds, showing the following: is triangular; and is triangular.
Recommendations
- Rainbow triangles and the Caccetta-Häggkvist conjecture
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- On Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- Short rainbow cycles for families of matchings and triangles
- Notes on Aharoni's rainbow cycle conjecture
Cites work
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- Graphs with maximal number of adjacent pairs of edges
- scientific article; zbMATH DE number 3630786 (Why is no real title available?)
- On Sets of Acquaintances and Strangers at any Party
- Rainbow cycles for families of matchings
- Rainbow triangles and the Caccetta-Häggkvist conjecture
Cited in
(2)
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)