Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"rainbow triangle"”.
-
Product Structure, Separating Systems, Freeze-Tag Problem, and Planar Multicolor Turan Number
… Finally, the fourth paper addresses the planar rainbow Turan problem, where the objective is to determine the smallest number of maximal planar graphs required on the same set of n vertices to guarantee a rainbow triangle (a triangle formed by edges from three distinct graphs). The paper …
-
Cycles and coloring in graphs and digraphs
… in directed graphs. The first concerns a rainbow generalization of the Caccetta-H\"{a}ggkvist conjecture, made by Aharoni. The Caccetta-H\"{a}ggkvist conjecture states that if $G$ is a simple digraph on $n$ vertices with minimum out-degree at least $k$, then there exists a directed cycle …
-
Enumerating combinatorial objects with limited sub-configurations
… an enumeration problem on Gallai colorings, i.e. rainbow triangle-free colorings. In particular, we describe the typical structure of Gallai r-colorings of complete graphs, and complete the characterization of the extremal graphs for Gallai colorings. This work heavily relies on the hypergraph …
-
On some problems in extremal, probabilistic and enumerative combinatorics
… of the complete graph on $n$ vertices without a rainbow triangle contains a clique of size $\Omega\left(n^{1/3}\log^2 n\right)$ which uses at most two colors, and this bound is tight up to the constant factor. We show that if instead of looking for large cliques one only tries to find subgraphs …
-
Gallai-Ramsey Number of An 8-Cycle
… that any k-edge-coloring of Kn contains either a rainbow (all different colored) triangle or a monochromatic copy of G. In this work, we establish the Gallai-Ramsey number of an 8-cycle for all positive integers.