Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture
DOI10.1137/22m1529658zbMath1519.05089arXiv2110.11183OpenAlexW4385581159WikidataQ123021316 ScholiaQ123021316MaRDI QIDQ6171263
He Guo, Shira Zerbib, Maria Chudnovsky, Ron Aharoni, Eli Berger
Publication date: 11 August 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.11183
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (1)
Cites Work
- Unnamed Item
- Short cycles in directed graphs
- On the Caccetta-Häggkvist conjecture
- On the girth of digraphs
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- Rainbow triangles and the Caccetta‐Häggkvist conjecture
- Girth of sparse graphs
- Counting flags in triangle-free digraphs
- Short rainbow cycles in graphs and matroids
- Rainbow cycles for families of matchings
This page was built for publication: Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture