Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
From MaRDI portal
Publication:2097174
DOI10.1016/j.dam.2022.09.016zbMath1503.05047OpenAlexW4302028728WikidataQ123166139 ScholiaQ123166139MaRDI QIDQ2097174
Publication date: 11 November 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.09.016
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Color degree and heterochromatic cycles in edge-colored graphs
- Rainbow generalizations of Ramsey theory: A survey
- Polychromatic Hamilton cycles
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Multicoloured Hamilton cycles
- Rainbow triangles in arc-colored tournaments
- Rainbow triangles in arc-colored digraphs
- The Erdős-Hajnal conjecture for rainbow triangles
- Rainbow triangles in three-colored graphs
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
- Rainbow triangles in edge-colored graphs
- Rainbow triangles and the Caccetta‐Häggkvist conjecture
- Edge colorings of complete graphs without tricolored triangles
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
- Transitiv orientierbare Graphen