Rainbow triangles in arc-colored tournaments
From MaRDI portal
Publication:2042207
DOI10.1007/s00373-021-02313-wzbMath1469.05065arXiv1805.03412OpenAlexW3160885855MaRDI QIDQ2042207
Ruonan Li, Yan Dong Bai, Wei Li, Sheng Gui Zhang
Publication date: 28 July 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.03412
irregularityrainbow trianglearc-colored tournamentmaximum monochromatic indegreemaximum monochromatic outdegree
Related Items (2)
Rainbow triangles in arc-colored digraphs ⋮ Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
Cites Work
- 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
- Rainbow generalizations of Ramsey theory: A survey
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Kernels by properly colored paths in arc-colored digraphs
- Rainbow triangles and cliques in edge-colored graphs
- Kernels by rainbow paths in arc-colored tournaments
- The Erdős-Hajnal conjecture for rainbow triangles
- Rainbow triangles in edge-colored Kneser graphs
- Rainbow triangles in three-colored graphs
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Rainbow triangles in edge-colored graphs
- Monochromatic sinks in \(k\)-arc colored tournaments
- 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
This page was built for publication: Rainbow triangles in arc-colored tournaments