Minimum‐degree conditions for rainbow triangles
V Falgas‐Ravry, K Markström… - Journal of Graph Theory, 2024 - Wiley Online Library
Abstract Let G≔(G 1, G 2, G 3) G:=(G_1,G_2,G_3) be a triple of graphs on a common vertex
set VV of size n n. A rainbow triangle in GG is a triple of edges (e 1, e 2, e 3) (e_1,e_2,e_3) …
set VV of size n n. A rainbow triangle in GG is a triple of edges (e 1, e 2, e 3) (e_1,e_2,e_3) …
Notes on Aharoni's rainbow cycle conjecture
Abstract In 2017, Ron Aharoni made the following conjecture about rainbow cycles in edge-
coloured graphs: If G is an n-vertex graph whose edges are coloured with n colours and …
coloured graphs: If G is an n-vertex graph whose edges are coloured with n colours and …
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture
The Caccetta–Häggkvist conjecture (denoted CHC) states that the directed girth (the
smallest length of a directed cycle) of a directed graph on vertices is at most, where is the …
smallest length of a directed cycle) of a directed graph on vertices is at most, where is the …
Cycles and coloring in graphs and digraphs
P Hompe - 2022 - uwspace.uwaterloo.ca
We show results in areas related to extremal problems in directed graphs. The first concerns
a rainbow generalization of the Caccetta-H\"{a} ggkvist conjecture, made by Aharoni. The …
a rainbow generalization of the Caccetta-H\"{a} ggkvist conjecture, made by Aharoni. The …